Paper Information - Computable bounds on parametric solutions of convex problems

Computable bounds on parametric solutions of convex problems

We present a new method for computing bounds on parametric solutions of convex problems. The approach is based on a uniform quadratic underestimation of the objective function and a simple technique for the calculation of bounds on the optimal value function.

Anthony V. Fiacco | Jerzy Kyparisis

[1] Eldon R. Hansen. Global optimization with data perturbations , 1984, Comput. Oper. Res..

[2] J. B. Rosen,et al. Inequalities for Stochastic Nonlinear Programming Problems , 1964 .

[3] S. M. Robinson. Generalized equations and their solutions, Part I: Basic theory , 1979 .

[4] Abolfazl Ghaemi. Computable stability analysis techniques for nonlinear programming: sensitivities, optimal value bounds, and applications , 1981 .

[5] James W. Daniel,et al. Stability of the solution of definite quadratic programs , 1973, Math. Program..

[6] Anthony Fiacco. Computable Optimal Value Bounds and Solution Vector Estimates for General Parametric NLP Programs. , 1981 .

[7] Stephen M. Robinson,et al. Computable error bounds for nonlinear programming , 1973, Math. Program..

[8] Donald M. Topkis,et al. Rates of Stability in Nonlinear Programming , 1976, Oper. Res..

[9] S. M. Robinson. An Application of Error Bounds for Convex Programming in a Linear Space , 1975 .

[10] Stephen M. Robinson,et al. Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms , 1974, Math. Program..

[11] E. Hansen. Global optimization using interval analysis — the multi-dimensional case , 1980 .

[12] Stephen M. Robinson,et al. Strongly Regular Generalized Equations , 1980, Math. Oper. Res..