Salta al contenuto principale
Ricerc@Sapienza
Toggle navigation
Home
Login
Home
Persone
giampaolo.liuzzi@uniroma1.it
Giampaolo Liuzzi
Professore Associato
Struttura:
DIPARTIMENTO DI INGEGNERIA INFORMATICA, AUTOMATICA E GESTIONALE -ANTONIO RUBERTI-
E-mail:
giampaolo.liuzzi@uniroma1.it
Pagina istituzionale corsi di laurea
Curriculum Sapienza
Pubblicazioni
Titolo
Pubblicato in
Anno
Worst Case Complexity Bounds for Linesearch-Type Derivative-Free Algorithms
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
2024
A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization
OPTIMIZATION LETTERS
2023
A Derivative-Free Line-Search Algorithm for Simulation-Driven Design Optimization Using Multi-Fidelity Computations
MATHEMATICS
2022
An Augmented Lagrangian Method Exploiting an Active-Set Strategy and Second-Order Information
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
2022
A computational study on QP problems with general linear constraints
OPTIMIZATION LETTERS
2022
Derivative-free methods for mixed-integer nonsmooth constrained optimization
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
2022
Derivative-free line-search algorithm for multi-fidelity optimization
AIAA Scitech 2021 Forum
2021
Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
2021
An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
MATHEMATICAL PROGRAMMING COMPUTATION
2020
Hybridization of multi-objective deterministic particle swarm with derivative-free local searches
MATHEMATICS
2020
On the convergence of steepest descent methods for multiobjective optimization
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
2020
A concave optimization-based approach for sparse multiobjective programming
OPTIMIZATION LETTERS
2020
Improving P300 Speller performance by means of optimization and machine learning
ANNALS OF OPERATIONS RESEARCH
2020
A concave optimization-based approach for sparse multiobjective programming
OPTIMIZATION LETTERS
2020
Trust-region methods for the derivative-free optimization of nonsmooth black-box functions
SIAM JOURNAL ON OPTIMIZATION
2019
A new branch-and-bound algorithm for standard quadratic programming problems
OPTIMIZATION METHODS & SOFTWARE
2019
A multi-objective DIRECT algorithm for ship hull optimization
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
2018
Hybrid global/local derivative-free multi-objective optimization via deterministic particle swarm with local linesearch
Machine Learning, Optimization, and Big Data Third International Conference, MOD 2017 Volterra, Italy, September 14 – 17, 2017 Revised Selected Papers
2018
An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
2018
Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
COMPUTATIONAL & APPLIED MATHEMATICS
2018
1
2
seguente ›
ultima »
Progetti di Ricerca
Models and methods for the solution of challenging optimization problems
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma