Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set

DOI10.1137/0803003zbMath0793.90052OpenAlexW2172127152MaRDI QIDQ4697308

Zhi-Quan Luo, Paul Tseng

Publication date: 29 June 1993

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

local error boundlinear rate of convergenceactive set algorithmsstrongly convex differentiable functionreduced- gradient projection algorithms

Mathematics Subject Classification ID

Convex programming (90C25) Variational inequalities (49J40) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Error bounds for inconsistent linear inequalities and programs, On linear convergence of iterative methods for the variational inequality problem, Error estimates and Lipschitz constants for best approximation in continuous function spaces, Error bounds in mathematical programming, The application of an oblique-projected Landweber method to a model of supervised learning, Error estimation in nonlinear optimization, Sufficient conditions for error bounds of difference functions and applications, Nonlinear complementarity as unconstrained and constrained minimization