Giampaolo Liuzzi

Optim. Lett., January, 2024

2022

A computational study on QP problems with general linear constraints.

[BibT_eX]

[DOI]

Marco Locatelli

Optim. Lett., 2022

An Augmented Lagrangian Method Exploiting an Active-Set Strategy and Second-Order Information.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2022

Convergence under Lipschitz smoothness of ease-controlled Random Reshuffling gradient Algorithms.

[BibT_eX]

[DOI]

Laura Palagi

Ruggiero Seccia

CoRR, 2022

Derivative-free methods for mixed-integer nonsmooth constrained optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2022

Improving P300 Speller performance by means of optimization and machine learning.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2022

2021

Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2021

2020

A concave optimization-based approach for sparse multiobjective programming.

[BibT_eX]

[DOI]

Optim. Lett., 2020

An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables.

[BibT_eX]

[DOI]

Math. Program. Comput., 2020

On the convergence of steepest descent methods for multiobjective optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2020

2019

Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions.

[BibT_eX]

[DOI]

SIAM J. Optim., 2019

A new branch-and-bound algorithm for standard quadratic programming problems.

[BibT_eX]

[DOI]

Marco Locatelli

Optim. Methods Softw., 2019

2018

An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2018

A multi-objective DIRECT algorithm for ship hull optimization.

[BibT_eX]

[DOI]

Emilio Fortunato Campana

Comput. Optim. Appl., 2018

2017

Hybrid Global/Local Derivative-Free Multi-objective Optimization via Deterministic Particle Swarm with Local Linesearch.

[BibT_eX]

[DOI]

Emilio Fortunato Campana

Umberto Iemma

Matteo Diez

Proceedings of the Machine Learning, Optimization, and Big Data, 2017

2016

A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2016

A nonmonotone GRASP.

[BibT_eX]

[DOI]

Math. Program. Comput., 2016

A DIRECT-type approach for derivative-free constrained global optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2016

Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2016

2015

Solving ℓ<sub>0</sub>-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method.

[BibT_eX]

[DOI]

Optim. Lett., 2015

Derivative-Free Methods for Mixed-Integer Constrained Optimization Problems.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2015

Global Optimization of Protein-peptide Docking by a Filling Function Method.

[BibT_eX]

[DOI]

Francesco Lampariello

J. Optim. Theory Appl., 2015

Derivative-Free Robust Optimization for Circuit Design.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2015

A filling function method for unconstrained global optimization.

[BibT_eX]

[DOI]

Francesco Lampariello

Comput. Optim. Appl., 2015

On the use of iterative methods in cubic regularization for unconstrained optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2015

2014

A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2014

2012

A concave optimization-based approach for sparse portfolio selection.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2012

A decomposition algorithm for unconstrained optimization problems with partial derivative information.

[BibT_eX]

[DOI]

A. Risi

Optim. Lett., 2012

Derivative-free methods for bound constrained mixed-integer optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2012

2011

On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds.

[BibT_eX]

[DOI]

Laura Palagi

Mauro Piacentini

Optim. Lett., 2011

A Modified DIviding RECTangles Algorithm for a Problem in Astrophysics.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2011

2010

Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization.

[BibT_eX]

[DOI]

Marco Sciandrone

SIAM J. Optim., 2010

A partition-based global optimization algorithm.

[BibT_eX]

[DOI]

J. Glob. Optim., 2010

A truncated Newton method in an augmented Lagrangian framework for nonlinear programming.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2010

A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2010

A global optimization algorithm for protein surface alignment.

[BibT_eX]

[DOI]

Paola Bertolazzi

Concettina Guerra

BMC Bioinform., 2010

2009

A Derivative-Free Algorithm for Inequality Constrained Nonlinear Programming via Smoothing of an l<sub>infty</sub> Penalty Function.

[BibT_eX]

[DOI]

SIAM J. Optim., 2009

2008

A derivative-free algorithm for systems of nonlinear inequalities.

[BibT_eX]

[DOI]

Optim. Lett., 2008

2006

A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems.

[BibT_eX]

[DOI]

Marco Sciandrone

SIAM J. Optim., 2006

2005

Design of induction motors using a mixed-variable approach.

[BibT_eX]

[DOI]

Comput. Manag. Sci., 2005

2004

A magnetic resonance device designed via global optimization techniques.

[BibT_eX]

[DOI]

Math. Program., 2004

2003

An Exact Augmented Lagrangian Function for Nonlinear Programming with Two-Sided Constraints.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2003

A Truncated Newton Method for the Solution of Large-Scale Inequality Constrained Minimization Problems.

[BibT_eX]

[DOI]

Francisco Facchinei