Computable bounds on parametric solutions of convex problems

DOI10.1007/BF01580732zbMath0649.90081MaRDI QIDQ1106102

Anthony V. Fiacco, Jerzy Kyparisis

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

upper and lower boundsparametric convex problem

Mathematics Subject Classification ID

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

Related Items

Global optimization of multi-parametric MILP problems, Sensitivity and stability analysis for nonlinear programming, An algorithm for approximate multiparametric convex programming, Characterizing optimality in mathematical programming models, Variable target value subgradient method, On parametric nonlinear programming, Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems

Cites Work

• Introduction to sensitivity and stability analysis in nonlinear programming
• Global optimization with data perturbations
• Global optimization using interval analysis - the multi-dimensional case
• Stability of the solution of definite quadratic programs
• Strongly Regular Generalized Equations
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• An Application of Error Bounds for Convex Programming in a Linear Space
• Rates of Stability in Nonlinear Programming
• Generalized equations and their solutions, Part I: Basic theory
• Computable error bounds for nonlinear programming
• Inequalities for Stochastic Nonlinear Programming Problems