Convergence properties of nonmonotone spectral projected gradient methods
From MaRDI portal
Publication:557737
Recommendations
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Convergence analysis for the modified spectral projected subgradient method
- Solving bound constrained optimization via a new nonmonotone spectral projected gradient method
- Convergence properties of inexact projected gradient methods
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- A new nonmonotone spectral projected gradient method for bound constrained optimization
- A note on the spectral gradient projection method for nonlinear monotone equations with applications
- Multivariate spectral gradient projection method for nonlinear monotone equations with convex constraints
- A Lagrangian dual spectral projected gradient method for nonconvex constrained optimization
- Nonmonotone projected gradient methods based on barrier and Euclidean distances
Cites work
- A Nonmonotone Line Search Technique for Newton’s Method
- A spectral conjugate gradient method for unconstrained optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- Convergence of the gradient projection method for generalized convex minimization
- Convergence properties of projection and contraction methods for variational inequality problems
- Convex programming in Hilbert space
- Family of projected descent methods for optimization problems with simple bounds
- Inexact spectral projected gradient methods on convex sets
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Nonmonotonic trust region algorithm
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- On the convergence of projected gradient processes to singular critical points
- On the gradient-projection method for solving the nonsymmetric linear complementarity problem
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Projected gradient methods for linearly constrained problems
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two facts on the convergence of the Cauchy algorithm
- Two-Point Step Size Gradient Methods
- Weak Sharp Minima in Mathematical Programming
- Weak Sharp Solutions of Variational Inequalities
Cited in
(28)- Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
- Hybrid limited memory gradient projection methods for box-constrained optimization problems
- On the application of the spectral projected gradient method in image segmentation
- Smoothing SQP algorithm for semismooth equations with box constraints
- On the convergence rate of scaled gradient projection method
- A new nonmonotone spectral projected gradient method for bound constrained optimization
- A stabilized simulated annealing based Barzilai-Borwein method for the solution of unconstrained optimization problems
- A multivariate spectral projected gradient method for bound constrained optimization
- Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics
- Inexact variable metric method for convex-constrained optimization problems
- Two error bounds for constrained optimization problems and their applications
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- scientific article; zbMATH DE number 2186558 (Why is no real title available?)
- Unified nonlinear Lagrangian approach to duality and optimal paths
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Convergence analysis for the modified spectral projected subgradient method
- Global and local R-linear convergence of a spectral projected gradient method for convex optimization with singular solution
- Nonmonotone projected gradient methods based on barrier and Euclidean distances
- Error bounds and finite termination for constrained optimization problems
- Impulse noise removal by an adaptive trust-region method
- On the inexact scaled gradient projection method
- Improving ultimate convergence of an augmented Lagrangian method
- Convergence properties of inexact projected gradient methods
- Solving bound constrained optimization via a new nonmonotone spectral projected gradient method
- Exponential convergence of Sobolev gradient descent for a class of nonlinear eigenproblems
- On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches
- Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem
- Global convergence and finite termination of a class of smooth penalty function algorithms
This page was built for publication: Convergence properties of nonmonotone spectral projected gradient methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557737)
