Finite perturbation of convex programs

DOI10.1007/BF01442401zbMath0733.90056MaRDI QIDQ810372

Michael C. Ferris, Olvi L. Mangasarian

Publication date: 1991

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

zbMATH Keywords

proximal point algorithmfinite Tikhonov regularizationfinite-perturbation propertyfinite-termination property

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items

Linear programming with nonparametric penalty programs and iterated thresholding, Finding normal solutions in piecewise linear programming, Characterization of solution sets of convex programs, Combining approximation and exact penalty in hierarchical programming, On Stochastic and Deterministic Quasi-Newton Methods for Nonstrongly Convex Optimization: Asymptotic Convergence and Rate Analysis, Robust Accelerated Primal-Dual Methods for Computing Saddle Points, The forward-backward splitting method for finding the minimum like-norm solution of the mixed variational inequality problem, A first order method for finding minimal norm-like solutions of convex optimization problems, A First Order Method for Solving Convex Bilevel Optimization Problems, On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems, An inertial extrapolation method for convex simple bilevel optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple characterization of solutions sets of convex programs
• Characterization of solution sets of convex programs
• Normal solutions of linear programs
• Exact penalty functions in nonlinear programming
• Nonlinear Perturbation of Linear Programs
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• A Necessary and Sufficient Qualification for Constrained Optimization