Convergence of a projected gradient method variant for quasiconvex objectives
From MaRDI portal
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
- A modified Frank-Wolfe algorithm and its convergence properties
- Convergence of direct methods for paramonotone variational inequalities
- Convergence of the gradient projection method for generalized convex minimization
- Convergence of the steepest descent method for minimizing quasiconvex functions
- Convex programming in Hilbert space
- Extension of subgradient techniques for nonsmooth optimization in Banach spaces
- Full convergence of the steepest descent method with inexact line searches
- scientific article; zbMATH DE number 5008819 (Why is no real title available?)
- scientific article; zbMATH DE number 4043629 (Why is no real title available?)
- scientific article; zbMATH DE number 3763196 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 3293978 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- Minimizing and Stationary Sequences of Constrained Optimization Problems
- On convergence properties of a least-distance programming procedure for minimization problems under linear constraints
- On the convergence properties of the projected gradient method for convex optimization
- On the Goldstein-Levitin-Polyak gradient projection method
- On the gradient-projection method for solving the nonsymmetric linear complementarity problem
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Projected gradient methods for linearly constrained problems
Cited in
(21)- On the convergence of the projected gradient method
- Convergence of the gradient projection method for generalized convex minimization
- Some improved projected quasi-Newton algorithms and their convergence. I: Methods and global behavior
- On the inexact scaled gradient projection method
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- Global convergence of a modified gradient projection method for convex constrained problems
- Inexact gradient projection method with relative error tolerance
- On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces
- Subgradient algorithms for solving variable inequalities
- A strongly convergent method for nonsmooth convex minimization in Hilbert spaces
- Convergence properties of inexact projected gradient methods
- Convergence of Projected Hessian Approximations in Quasi-Newton Methods for the Nonlinear Programming Problem
- scientific article; zbMATH DE number 4087432 (Why is no real title available?)
- scientific article; zbMATH DE number 1146103 (Why is no real title available?)
- A steepest descent-like method for variable order vector optimization problems
- A steepest descent-like method for vector optimization problems with variable domination structure
- On the convergence properties of the projected gradient method for convex optimization
- A note on the gradient projection method with exact stepsize rule
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- 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)
