Convergence of a projected gradient method variant for quasiconvex objectives
From MaRDI portal
Publication:992826
DOI10.1016/J.NA.2010.06.051zbMATH Open1198.90356OpenAlexW1985703530MaRDI QIDQ992826FDOQ992826
Authors: J. Martínez 
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
Recommendations
- On the convergence properties of the projected gradient method for convex optimization
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Convergence of the gradient projection method for generalized convex minimization
- scientific article; zbMATH DE number 3880458
Cites Work
- Projected gradient methods for linearly constrained problems
- Convex programming in Hilbert space
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence of direct methods for paramonotone variational inequalities
- Title not available (Why is that?)
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- On the Goldstein-Levitin-Polyak gradient projection method
- Full convergence of the steepest descent method with inexact line searches
- Convergence of the gradient projection method for generalized convex minimization
- Minimizing and Stationary Sequences of Constrained Optimization Problems
- Convergence of the steepest descent method for minimizing quasiconvex functions
- On the convergence properties of the projected gradient method for convex optimization
- On the gradient-projection method for solving the nonsymmetric linear complementarity problem
- Extension of subgradient techniques for nonsmooth optimization in Banach spaces
- On convergence properties of a least-distance programming procedure for minimization problems under linear constraints
- A modified Frank-Wolfe algorithm and its convergence properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (20)
- Global convergence of a modified gradient projection method for convex constrained problems
- Convergence of Projected Hessian Approximations in Quasi-Newton Methods for the Nonlinear Programming Problem
- Subgradient algorithms for solving variable inequalities
- Title not available (Why is that?)
- Convergence of the gradient projection method for generalized convex minimization
- A steepest descent-like method for variable order vector optimization problems
- A note on the gradient projection method with exact stepsize rule
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- A steepest descent-like method for vector optimization problems with variable domination structure
- 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
- A strongly convergent method for nonsmooth convex minimization in Hilbert spaces
- On the inexact scaled gradient projection method
- Convergence properties of inexact projected gradient methods
- On the convergence properties of the projected gradient method for convex optimization
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- Some improved projected quasi-Newton algorithms and their convergence. I: Methods and global behavior
- Inexact gradient projection method with relative error tolerance
- Title not available (Why is that?)
- Convergence of one-step projected gradient methods for variational inequalities
This page was built for publication: Convergence of a projected gradient method variant for quasiconvex objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992826)
