A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization

DOI10.1287/moor.1060.0193zbMath1278.90289OpenAlexW2162196200MaRDI QIDQ5387987

Marc Teboulle, Amir Beck

Publication date: 27 May 2008

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e3dfbb2260acb8ef059919526680254870f1fe17

zbMATH Keywords

gradient projection algorithmconvex minimizationrate of convergence analysisquadratically constrained problems

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Related Items (5)

Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems ⋮ Efficient min–max MPC: Achieving a large domain of attraction with short horizon ⋮ Nonconvex proximal incremental aggregated gradient method with linear convergence ⋮ Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems

This page was built for publication: A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization