Global error bounds for convex conic problems

SIAM Journal on Optimization

Volumn 10, Issue 3, 2000, Pages 836-851

  Zhang, Shuzhong ^a,b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

Condition number; Convex conic problems; Error bound

Indexed keywords

EID: 0034391880     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S105262349834429X     Document Type: Article

References (31)

1. H.H. BAUSCHKE AND J.M. BORWEIN, On projection algorithms for solving convex feasibility problems, SIAM Review, 38 (1996), pp. 367-426.
2. H.H. BAUSCHKE, J.M. BORWEIN, AND W. LI, Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization, Math. Program., 86 (1999), pp. 135-160.
3. C. BERGTHALLER AND I. SINGER, The distance to a polyhedron, Linear Algebra Appl., 169 (1992), pp. 111-129.
4. J.V. BURKE AND P. TSENG, A unified analysis of Huffman's bound via Fenchel duality, SIAM J. Optim., 6 (1996), pp. 265-282.
5. S. DENG AND H. HU, Computable error bounds for semidefinite programming, J. Global Optim., 14 (1999), pp. 105-115.
6. I.I. DIKIN, Iterative solution of problems of linear and quadratic programming, Soviet Math. Dokl., 8 (1967), pp. 674-675.
7. O. GÜLER, A.J. HOFFMAN, AND U.G. ROTHBLUM, Approximations to solutions to systems of linear inequalities, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 688-696.
8. A.J. HOFFMAN, On approximate solutions of systems of linear inequalities, J. Research of the National Bureau of Standards, 49 (1952), pp. 263-265.
9. A.J. HOFFMAN, The distance to the intersection of two convex sets by the distances to each of them, Math. Nachr., 157 (1992), pp. 81-98.
10. A. HOLDER, J.F. STURM, AND S. ZHANG, Analytic Central Path, Sensitivity Analysis and Parametric Programming, Report 9801/A, Econometric Institute, Erasmus University Rotterdam, The Netherlands, 1998.
11. H. HU AND Q. WANG, On approximate solutions of infinite systems of linear inequalities, Linear Algebra Appl., 114/115 (1989), pp. 429-438.
12. G.J.O. JAMESON, The duality of pairs of wedges, Proc. London Math. Soc., 24 (1972), pp. 531-547.
13. D. KLATTE AND G. THIERE, Error bounds for solutions of linear equations and inequalities, ZOR - Math. Methods Oper. Res., 41 (1995), pp. 191-214.
14. D. KLATTE AND G. THIERE, A note of Lipschitz constants for solutions of linear inequalities and equations, Linear Algebra Appl., 244 (1996), pp. 365-374.
15. W. LI, The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program, Linear Algebra Appl., 187 (1993), pp. 15-40.
16. W. LI AND I. SINGER, Global error bounds for convex multifunctions and applications, Math. Oper. Res., 23 (1998), pp. 443-462.
17. Z.Q. LUO, J.F. STURM, AND S. ZHANG, Duality Results for Conic Convex Programming, Report 9719/A, Econometric Institute, Erasmus University Rotterdam, The Netherlands, 1997.
18. O.L. MANGASARIAN, A condition number of linear inequalities and equalities, in Proceedings of the Sixth Symposium über Operations Research, Universität Ausburg, 1981, G. Bamber and O. Opitz, eds., Methods Oper. Res., 43 (1981), pp. 3-15.
19. O.L. MANGASARIAN, A condition number for differentiate convex inequalities, Math. Oper. Res., 10 (1985), pp. 474-484.
20. O.L. MANGASARIAN AND T.-H. SHIAU, Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems, SIAM J. Control Optim., 25 (1987), pp. 583-595.
21. YU. NESTEROV AND A. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM Stud. Appl. Math., 13, Philadelphia, PA, 1994.
22. J.-S. PANG, Error bounds in mathematical programming, Math. Programming, 79 (1997), pp. 299-332.
23. J. RENEGAR, Some perturbation theory for linear programming, Math. Programming, 65 (1994), pp. 73-91.
24. S.M. ROBINSON, An application of error bounds for convex programming in a linear space, SIAM J. Control, 13 (1975), pp. 271-273.
25. R.T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
26. G.W. STEWART, On scaled projections and pseudoinverses, Linear Algebra Appl., 112 (1989), pp. 189-193.
27. J.F. STURM, Error bounds for linear matrix inequalities, SIAM J. Control Optim., to appear.
28. J.F. STURM AND S. ZHANG, On Sensitivity of Central Solutions in Semidefinite Programming, Report 9813/A, Econometric Institute, Erasmus University Rotterdam, The Netherlands, 1998.
29. M.J. TODD, A Dantzig-Wolfe-like variant of Karmarkar's interior-point linear programming algorithm, Oper. Res., 38 (1990), pp. 1006-1018.
30. M.J. TODD, L. TUNÇEL, AND Y. YE, Probabilistic Analysis of Two Complexity Measures for Linear Programming Problems, Report CORR 98-48, Cornell University, Ithaca, NY, 1998.
31. S.A. VAVASIS AND Y. YE, A primal-dual interior point method whose running time depends only on the constraint matrix, Math. Programming, 74 (1996), pp. 79-120.