Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
From MaRDI portal
Publication:2329657
DOI10.1007/s11590-018-1353-8zbMath1428.90150OpenAlexW2901924522MaRDI QIDQ2329657
N. S. Fazzio, María Laura Schuverdt
Publication date: 18 October 2019
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-018-1353-8
Related Items (13)
A nonmonotone gradient method for constrained multiobjective optimization problems ⋮ Using first-order information in direct multisearch for multiobjective optimization ⋮ A quasi-Newton method with Wolfe line searches for multiobjective optimization ⋮ A concave optimization-based approach for sparse multiobjective programming ⋮ Convergence analysis of a projected gradient method for multiobjective optimization problems ⋮ Conditional gradient method for vector optimization ⋮ A Barzilai-Borwein descent method for multiobjective optimization problems ⋮ Nonmonotone line searches for unconstrained multiobjective optimization problems ⋮ Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization ⋮ On the inexact scaled gradient projection method ⋮ Globally convergent Newton-type methods for multiobjective optimization ⋮ A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization ⋮ Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
Uses Software
Cites Work
- Family of projected descent methods for optimization problems with simple bounds
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- A projected gradient method for vector optimization problems
- A class on nonmonotone stabilization methods in unconstrained optimization
- Inexact projected gradient method for vector optimization
- On the convergence of the projected gradient method for vector optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Algorithm 851
- Two-Point Step Size Gradient Methods
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- Inexact spectral projected gradient methods on convex sets
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Full convergence of the steepest descent method with inexact line searches
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- On the Barzilai and Borwein choice of steplength for the gradient method
- The Gradient Projection Method under Mild Differentiability Conditions
- On the nonmonotone line search
- Unnamed Item
- Unnamed Item
This page was built for publication: Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
