Stefano Lucidi

Orcid: 0000-0003-4356-7958

According to our database1, Stefano Lucidi authored at least 84 papers between 1992 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
9
10
3
2
5
3
3
3
1
1
9
3
3
2
4
4
3
1
1
1
4
2
2
6
3
3
3
1
1
2
1
1
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Necessary Optimality Conditions for Sets of Points in Multiobjective Optimization.
J. Optim. Theory Appl., October, 2024

Worst Case Complexity Bounds for Linesearch-Type Derivative-Free Algorithms.
J. Optim. Theory Appl., October, 2024

A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization.
Optim. Lett., January, 2024

2023
A two-objective optimization of ship itineraries for a cruise company.
4OR, December, 2023

A simulation-based optimization approach for the calibration of a discrete event simulation model of an emergency department.
Ann. Oper. Res., 2023

2022
An Augmented Lagrangian Method Exploiting an Active-Set Strategy and Second-Order Information.
J. Optim. Theory Appl., 2022

A Mixed Finite Differences Scheme for Gradient Approximation.
J. Optim. Theory Appl., 2022

Solving non-monotone equilibrium problems via a DIRECT-type approach.
J. Glob. Optim., 2022

Derivative-free methods for mixed-integer nonsmooth constrained optimization.
Comput. Optim. Appl., 2022

Minimization over the ℓ <sub>1</sub>-ball using an active-set non-monotone projected gradient.
Comput. Optim. Appl., 2022

2021
A derivative-free optimization approach for the autotuning of a Forex trading strategy.
Optim. Lett., 2021

Cruise itineraries optimal scheduling.
Optim. Lett., 2021

A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints.
Comput. Optim. Appl., 2021

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

An active-set algorithmic framework for non-convex optimization problems over the simplex.
Comput. Optim. Appl., 2020

On the convergence of steepest descent methods for multiobjective optimization.
Comput. Optim. Appl., 2020

2019
Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions.
SIAM J. Optim., 2019

Derivative free methodologies for circuit worst case analysis.
Optim. Lett., 2019

On global minimizers of quadratic functions with cubic regularization.
Optim. Lett., 2019

2018
A multi-objective DIRECT algorithm for ship hull optimization.
Comput. Optim. Appl., 2018

2017
A Two-Stage Active-Set Algorithm for Bound-Constrained Optimization.
J. Optim. Theory Appl., 2017

Hybrid Global/Local Derivative-Free Multi-objective Optimization via Deterministic Particle Swarm with Local Linesearch.
Proceedings of the Machine Learning, Optimization, and Big Data, 2017

2016
A Simulation-Based Multiobjective Optimization Approach for Health Care Service Management.
IEEE Trans Autom. Sci. Eng., 2016

A Fast Active Set Block Coordinate Descent Algorithm for ℓ<sub>1</sub>-Regularized Least Squares.
SIAM J. Optim., 2016

A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization.
SIAM J. Optim., 2016

A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming.
SIAM J. Optim., 2016

A derivative-free approach for a simulation-based optimization problem in healthcare.
Optim. Lett., 2016

A nonmonotone GRASP.
Math. Program. Comput., 2016

A DIRECT-type approach for derivative-free constrained global optimization.
Comput. Optim. Appl., 2016

Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization.
Comput. Optim. Appl., 2016

An application of support vector machines to sales forecasting under promotions.
4OR, 2016

2015
A Derivative-Free Algorithm for Constrained Global Optimization Based on Exact Penalty Functions.
J. Optim. Theory Appl., 2015

Derivative-Free Methods for Mixed-Integer Constrained Optimization Problems.
J. Optim. Theory Appl., 2015

Derivative-Free Robust Optimization for Circuit Design.
J. Optim. Theory Appl., 2015

2014
A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization.
SIAM J. Optim., 2014

Feasibility Pump-like heuristics for mixed integer problems.
Discret. Appl. Math., 2014

Combining optimization and machine learning techniques for genome-wide prediction of human cell cycle-regulated genes.
Bioinform., 2014

2013
A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach.
SIAM J. Optim., 2013

An exact penalty global optimization approach for mixed-integer programming problems.
Optim. Lett., 2013

2012
Finite-Element-Based Multiobjective Design Optimization Procedure of Interior Permanent Magnet Synchronous Motors for Wide Constant-Power Region Operation.
IEEE Trans. Ind. Electron., 2012

An approach to constrained global optimization based on exact penalty functions.
J. Glob. Optim., 2012

An active set feasible method for large-scale minimization problems with bound constraints.
Comput. Optim. Appl., 2012

Derivative-free methods for bound constrained mixed-integer optimization.
Comput. Optim. Appl., 2012

2011
Continuous Reformulations for Zero-one Programming Problems.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

A New Feasibility Pump-Like Heuristic for Mixed Integer Problems.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization.
SIAM J. Optim., 2010

A partition-based global optimization algorithm.
J. Glob. Optim., 2010

A truncated Newton method in an augmented Lagrangian framework for nonlinear programming.
Comput. Optim. Appl., 2010

A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems.
Comput. Optim. Appl., 2010

2009
A Convergent Hybrid Decomposition Algorithm Model for SVM Training.
IEEE Trans. Neural Networks, 2009

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

A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization.
Optim. Lett., 2009

2008
A derivative-free algorithm for systems of nonlinear inequalities.
Optim. Lett., 2008

2007
A convergent decomposition algorithm for support vector machines.
Comput. Optim. Appl., 2007

2006
A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems.
SIAM J. Optim., 2006

2005
An Algorithm Model for Mixed Variable Programming.
SIAM J. Optim., 2005

Convergence conditions, line search algorithms and trust region implementations for the Polak-Ribière conjugate gradient method.
Optim. Methods Softw., 2005

Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming.
Math. Oper. Res., 2005

Design of induction motors using a mixed-variable approach.
Comput. Manag. Sci., 2005

2004
A derivative-based algorithm for a particular class of mixed variable optimization problems.
Optim. Methods Softw., 2004

A magnetic resonance device designed via global optimization techniques.
Math. Program., 2004

2003
An Exact Augmented Lagrangian Function for Nonlinear Programming with Two-Sided Constraints.
Comput. Optim. Appl., 2003

A Truncated Newton Method for the Solution of Large-Scale Inequality Constrained Minimization Problems.
Comput. Optim. Appl., 2003

2002
An Augmented Lagrangian Function with Improved Exactness Properties.
SIAM J. Optim., 2002

On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization.
SIAM J. Optim., 2002

A Truncated Newton Algorithm for Large Scale Box Constrained Optimization.
SIAM J. Optim., 2002

Objective-derivative-free methods for constrained optimization.
Math. Program., 2002

New Classes of Globally Convexized Filled Functions for Global Optimization.
J. Glob. Optim., 2002

A Derivative-Free Algorithm for Bound Constrained Optimization.
Comput. Optim. Appl., 2002

1999
A Mathematical Programming Approach for the Solution of the Railway Yield Management Problem.
Transp. Sci., 1999

Solving the Trust-Region Subproblem using the Lanczos Method.
SIAM J. Optim., 1999

A Shifted-Barrier Primal-Dual Algorithm Model for Linearly Constrained Optimization Problems.
Comput. Optim. Appl., 1999

1998
Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization.
SIAM J. Optim., 1998

On Some Properties of Quadratic Programs with a Convex Quadratic Constraint.
SIAM J. Optim., 1998

Convergence to Second Order Stationary Points in Inequality Constrained Optimization.
Math. Oper. Res., 1998

1997
A globally convergent version of the Polak-Ribière conjugate gradient method.
Math. Program., 1997

A New Version of the Price's Algorithm for Global Optimization.
J. Glob. Optim., 1997

Numerical Experiences with New Truncated Newton Methods in Large Scale Unconstrained Optimization.
Comput. Optim. Appl., 1997

1996
Nonmonotone curvilinear line search methods for unconstrained optimization.
Comput. Optim. Appl., 1996

1994
On the role of continuously differentiable exact penalty functions in constrained global optimization.
J. Glob. Optim., 1994

1993
A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set.
Oper. Res. Lett., 1993

A smooth method for the finite minimax problem.
Math. Program., 1993

Nonmonotone conjugate gradient methods for optimization.
Proceedings of the System Modelling and Optimization: Proceedings of the 16th IFIP-TC7 Conference, 1993

1992
New Results on a Continuously Differentiable Exact Penalty Function.
SIAM J. Optim., 1992


  Loading...