A nonmonotone front descent method for bound-constrained multi-objective optimization

DOI10.1007/S10589-026-00822-ZMaRDI QIDQ7346799zbMATH OpenFDO

Authors Pierluigi Mansueto

Publication date 11 September 2026

Published in Computational Optimization and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10589-026-00822-Z

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Cites work

• A bi-objective optimization based acquisition strategy for batch Bayesian global optimization
• A limited memory quasi-Newton approach for multi-objective optimization
• A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• A projected gradient method for vector optimization problems
• A subjective assessment of alternative mission architectures for the human exploration of Mars at NASA using multicriteria decision making.
• An Adaptive Scalarization Method in Multiobjective Optimization
• Benchmarking optimization software with performance profiles.
• Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
• Direct Multisearch for Multiobjective Optimization
• Dominating sets for convex functions with some applications
• Effective front-descent algorithms with convergence guarantees
• Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
• Improved front steepest descent for multi-objective optimization
• Newton's method for multiobjective optimization
• Nonmonotone gradient methods for vector optimization with a portfolio optimization application
• Nonmonotone line searches for unconstrained multiobjective optimization problems
• On the convergence of steepest descent methods for multiobjective optimization
• Pareto front approximation through a multi-objective augmented Lagrangian method
• Scalarizing vector optimization problems
• Steepest descent methods for multicriteria optimization.
• Twenty years of continuous multiobjective optimization in the twenty-first century

This page was built for publication: A nonmonotone front descent method for bound-constrained multi-objective optimization

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