Effective front-descent algorithms with convergence guarantees

DOI10.1137/25M1726856MaRDI QIDQ7230411zbMATH OpenFDO

Authors Matteo Lapucci, Pierluigi Mansueto, Davide Pucci

Publication date 17 April 2026

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/25M1726856

zbMATH Keywords

descent algorithmsglobal convergencemultiobjective optimizationnonconvex optimizationPareto front

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Cites work

• A box decomposition algorithm to compute the hypervolume indicator
• A derivative-free approach to constrained multiobjective nonsmooth optimization
• A limited memory quasi-Newton approach for multi-objective optimization
• A memetic procedure for global multi-objective optimization
• A quasi-Newton method with Wolfe line searches for multiobjective optimization
• A trust-region approach for computing Pareto fronts in multiobjective optimization
• Benchmarking optimization software with performance profiles.
• Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
• Complexity of gradient descent for multiobjective optimization
• Convergence and complexity guarantees for a wide class of descent algorithms in nonconvex multi-objective optimization
• Direct Multisearch for Multiobjective Optimization
• DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization
• Globally convergent Newton-type methods for multiobjective optimization
• Improved front steepest descent for multi-objective optimization
• Newton's method for multiobjective optimization
• Nonlinear Conjugate Gradient Methods for Vector Optimization
• On the convergence of steepest descent methods for multiobjective optimization
• On the use of polynomial models in multiobjective directional direct search
• Pareto front approximation through a multi-objective augmented Lagrangian method
• Quasi-Newton's method for multiobjective optimization
• Steepest descent methods for multicriteria optimization.
• Twenty years of continuous multiobjective optimization in the twenty-first century
• Worst-case complexity bounds of directional direct-search methods for multiobjective optimization

Cited in

(2)

• Objective-function free multi-objective optimization: rate of convergence and performance of an Adagrad-like algorithm
• A nonmonotone front descent method for bound-constrained multi-objective optimization

This page was built for publication: Effective front-descent algorithms with convergence guarantees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230411)