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

DOI10.1137/0803003MaRDI QIDQ4697308zbMATH OpenOpenAlexFDO

Authors 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) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Variational inequalities (49J40)

Recommendations

• Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
• Subgradient projection algorithms for convex feasibility problems in the presence of computational errors
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• Error bound estimation of the generalized linear complementarity problem over a polyhedral cone
• Explicit and efficient error estimation for convex minimization problems
• scientific article; zbMATH DE number 4158384
• A unified approach to error bounds for structured convex optimization problems
• Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube
• Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM
• Global error bound for the generalized linear complementarity problem over a polyhedral cone

Cited in

(10)

• Error estimates and Lipschitz constants for best approximation in continuous function spaces
• Nonlinear complementarity as unconstrained and constrained minimization
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• The application of an oblique-projected Landweber method to a model of supervised learning
• Error bounds in mathematical programming
• Sufficient conditions for error bounds of difference functions and applications
• Error bounds for inconsistent linear inequalities and programs
• On linear convergence of iterative methods for the variational inequality problem
• Error estimation in nonlinear optimization
• Regularized method of linearization for minimizing a convex function on a polyhedral set with errors in the input data

This page was built for publication: Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4697308)