Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
From MaRDI portal
Publication:2329657
DOI10.1007/S11590-018-1353-8zbMATH Open1428.90150OpenAlexW2901924522MaRDI QIDQ2329657FDOQ2329657
Authors: 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
Recommendations
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- Linear convergence analysis for a nonmonotone projected gradient algorithm solving multiobjective optimization problems
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
Cites Work
- Algorithm 851
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Title not available (Why is that?)
- A class on nonmonotone stabilization methods in unconstrained optimization
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- A projected gradient method for vector optimization problems
- Inexact projected gradient method for vector optimization
- On the convergence of the projected gradient method for vector optimization
- On the Barzilai and Borwein choice of steplength for the gradient method
- Full convergence of the steepest descent method with inexact line searches
- On the nonmonotone line search
- Family of projected descent methods for optimization problems with simple bounds
- Inexact spectral projected gradient methods on convex sets
- The Gradient Projection Method under Mild Differentiability Conditions
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- Investigation on a nonmonotone cautious BFGS algorithm
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
Cited In (28)
- Conditional gradient method for vector optimization
- An inexact nonmonotone projected gradient method for constrained multiobjective optimization
- Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Linear convergence analysis for a nonmonotone projected gradient algorithm solving multiobjective optimization problems
- Accelerated nonmonotone line search technique for multiobjective optimization
- A Barzilai-Borwein descent method for multiobjective optimization problems
- Conditional gradient method for multiobjective optimization
- Two adaptive nonmonotone trust-region algorithms for solving multiobjective optimization problems
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems on Riemannian manifolds
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- A quasi-Newton method with Wolfe line searches for multiobjective optimization
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- Scaled-PAKKT sequential optimality condition for multiobjective problems and its application to an augmented Lagrangian method
- A concave optimization-based approach for sparse multiobjective programming
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
- On the inexact scaled gradient projection method
- Convergence rates analysis of a multiobjective proximal gradient method
- Convergence analysis of a projected gradient method for multiobjective optimization problems
- Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
- Nonmonotone line searches for unconstrained multiobjective optimization problems
- Globally convergent Newton-type methods for multiobjective optimization
- Inexact exponential penalty function with the augmented Lagrangian for multiobjective optimization algorithms
- Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem
- A nonmonotone projected gradient method for multiobjective problems on convex sets
- Using first-order information in direct multisearch for multiobjective optimization
- On the convergence of the projected gradient method for vector optimization
Uses Software
This page was built for publication: Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329657)