A note on finite termination of iterative algorithms in mathematical programming

DOI10.1016/j.orl.2008.07.005zbMath1179.90260MaRDI QIDQ2517801

Jin Chuan Zhou, Chang-Yu Wang

Publication date: 9 January 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.07.005

zbMATH Keywords

variational inequality; convex programming; finite termination

Mathematics Subject Classification ID

90C25: Convex programming

49J40: Variational inequalities

Related Items

Weakly sharp solutions and finite convergence of algorithms for a variational inequality problem, On finite convergence of iterative methods for variational inequalities in Hilbert spaces, Finite convergence of the proximal point algorithm for variational inequality problems, Weak sharp solutions for generalized variational inequalities, Finite convergence analysis and weak sharp solutions for variational inequalities, Weak sharp solutions for nonsmooth variational inequalities, Error bounds and finite termination for constrained optimization problems, Weak sharpness and finite convergence for solutions of nonsmooth variational inequalities in Hilbert spaces, Weak sharpness for set-valued variational inequalities and applications to finite termination of iterative algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
• A simple characterization of solutions sets of convex programs
• Finite termination of the proximal point algorithm
• Weak sharp minima revisited. II: Application to linear regularity and error bounds
• Optimizing matrix stability
• Weak Sharp Minima in Mathematical Programming
• Weak Sharp Solutions of Variational Inequalities
• Variational Analysis
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Hoffman's Error Bound, Local Controllability, and Sensitivity Analysis