On the convergence properties of the projected gradient method for convex optimization
From MaRDI portal
Publication:539648
zbMath1213.90197MaRDI QIDQ539648
Publication date: 30 May 2011
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.scielo.br/scielo.php?script=sci_abstract&pid=S1807-03022003000100003&lng=en&nrm=iso&tlng=en
Related Items (29)
First-order geometric multilevel optimization for discrete tomography ⋮ Learning Multiple Quantiles With Neural Networks ⋮ Modified basic projection methods for a class of equilibrium problems ⋮ Selecting Regularization Parameters for Nuclear Norm--Type Minimization Problems ⋮ Incorporating multiple a priori information for inverse problem by inexact scaled gradient projection ⋮ Paige's algorithm for solving a class of tensor least squares problem ⋮ On the stationarity for nonlinear optimization problems with polyhedral constraints ⋮ An efficient iterative method for solving a class of constrained tensor least squares problem ⋮ Kernel Wiener filtering model with low-rank approximation for image denoising ⋮ The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions ⋮ Inexact gradient projection method with relative error tolerance ⋮ Active Set Complexity of the Away-Step Frank--Wolfe Algorithm ⋮ Full convergence of an approximate projection method for nonsmooth variational inequalities ⋮ A cyclic block coordinate descent method with generalized gradient projections ⋮ Finite termination of inexact proximal point algorithms in Hilbert spaces ⋮ On image reconstruction algorithms for binary electromagnetic geotomography ⋮ Convergent Lagrangian heuristics for nonlinear minimum cost network flows ⋮ Steplength selection in gradient projection methods for box-constrained quadratic programs ⋮ Convergence of a projected gradient method variant for quasiconvex objectives ⋮ Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization ⋮ Piecewise convexity of artificial neural networks ⋮ On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces ⋮ Deep unfolding of a proximal interior point method for image restoration ⋮ Polar Convolution ⋮ On the inexact scaled gradient projection method ⋮ On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches ⋮ Temporal optimization of radiation therapy to heterogeneous tumour populations and cancer stem cells ⋮ Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems ⋮ Hybrid limited memory gradient projection methods for box-constrained optimization problems
This page was built for publication: On the convergence properties of the projected gradient method for convex optimization
