A nonmonotone projected gradient method for multiobjective problems on convex sets

DOI10.1007/S40305-022-00410-YMaRDI QIDQ6566784zbMATH OpenFDO

Authors Gabrie Aníbal Carrizo, Nadia Soledad Fazzio, María Laura Schuverdt

Publication date 3 July 2024

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40305-022-00410-Y

zbMATH Keywords

global convergencemulti-objective optimizationnon-monotone line searchprojected gradient methods

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29)

Recommendations

• Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
• Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
• Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
• Linear convergence analysis for a nonmonotone projected gradient algorithm solving multiobjective optimization problems
• A nonmonotone gradient method for constrained multiobjective optimization problems

Cites work

• 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
• Barzilai and Borwein's method for multiobjective optimization problems
• Benchmarking optimization software with performance profiles.
• Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
• Direct Multisearch for Multiobjective Optimization
• scientific article; zbMATH DE number 4055377 (Why is no real title available?)
• Inexact projected gradient method for vector optimization
• Inexact spectral projected gradient methods on convex sets
• 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
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• On the convergence of the projected gradient method for vector optimization
• Testing Unconstrained Optimization Software

Cited in

(6)

• Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem
• Scaled-PAKKT sequential optimality condition for multiobjective problems and its application to an augmented Lagrangian method
• A diagonal quasi-Newton method with modified BFGS update for nonconvex multiobjective optimization
• An exact penalty method with nonmonotone line search and rapid infeasibility detection for constrained multiobjective optimization: application in supervised machine learning
• The projected gradient direction in vector optimization: continuity and dual characterization
• A nonmonotone line search method for solving constrained multiobjective optimization problems

This page was built for publication: A nonmonotone projected gradient method for multiobjective problems on convex sets

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