On the finite termination of the gradient projection method
From MaRDI portal
Publication:5244128
DOI10.23952/JNVA.3.2019.1.03zbMath1425.90080OpenAlexW4238888010MaRDI QIDQ5244128
No author found.
Publication date: 20 November 2019
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.23952/jnva.3.2019.1.03
Convex programming (90C25) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On finite convergence of iterative methods for variational inequalities in Hilbert spaces
- Finite convergence of the proximal point algorithm for variational inequality problems
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Finite termination of the proximal point algorithm
- Nonlinear programming and variational inequality problems. A unified approach
- Finite convergence analysis and weak sharp solutions for variational inequalities
- Convex Optimization in Normed Spaces
- Weak Sharp Minima in Mathematical Programming
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Weak Sharp Solutions of Variational Inequalities
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- Signal Recovery by Proximal Forward-Backward Splitting
- Convex programming in Hilbert space
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: On the finite termination of the gradient projection method