Convergence of a projected gradient method variant for quasiconvex objectives
From MaRDI portal
Publication:992826
DOI10.1016/j.na.2010.06.051zbMath1198.90356OpenAlexW1985703530MaRDI QIDQ992826
Publication date: 10 September 2010
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2010.06.051
Related Items
Subgradient algorithms for solving variable inequalities ⋮ A steepest descent-like method for vector optimization problems with variable domination structure ⋮ Inexact gradient projection method with relative error tolerance ⋮ A steepest descent-like method for variable order vector optimization problems ⋮ The self regulation problem as an inexact steepest descent method for multicriteria optimization ⋮ Convergence of the projected gradient method for quasiconvex multiobjective optimization ⋮ On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces ⋮ On the inexact scaled gradient projection method ⋮ A Strongly Convergent Method for Nonsmooth Convex Minimization in Hilbert Spaces
Cites Work
- On the convergence properties of the projected gradient method for convex optimization
- Convergence of direct methods for paramonotone variational inequalities
- On the gradient-projection method for solving the nonsymmetric linear complementarity problem
- On convergence properties of a least-distance programming procedure for minimization problems under linear constraints
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Convergence of the gradient projection method for generalized convex minimization
- A modified Frank-Wolfe algorithm and its convergence properties
- Convergence of the steepest descent method for minimizing quasiconvex functions
- Projected gradient methods for linearly constrained problems
- On the Goldstein-Levitin-Polyak gradient projection method
- Minimizing and Stationary Sequences of Constrained Optimization Problems
- Full convergence of the steepest descent method with inexact line searches
- Convex programming in Hilbert space
- Extension of subgradient techniques for nonsmooth optimization in Banach spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
