Error bounds for linear matrix inequalities

SIAM Journal on Optimization

Volumn 10, Issue 4, 2000, Pages 1228-1248

  Sturm, Jos F ^a  

^a MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Error bounds; Linear matrix inequality; Regularized duality; Semidefinite programming

Indexed keywords

EID: 0034195621     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623498338606     Document Type: Article

References (36)

1. F. ALIZADEH, J.A. HAEBERLY, AND M.L. OVERTON, Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results, SIAM J. Optim., 8 (1998), pp. 746-768.
2. G. BARKER AND D. CARLSON, Cones of diagonally dominant matrices, Pacific J. Math., 57 (1975), pp. 14-32.
3. F. BOHNENBLUST, Joint Positiveness of Matrices, Tech. report, University of California, Los Angeles, CA, 1948.
4. J.F. BONNANS AND A. SHAPIRO, Optimization problems with perturbations: A guided tour, SIAM Rev., 40 (1998), pp. 228-264.
5. J. BORWEIN AND H. WOLKOWICZ, Regularizing the abstract convex program, J. Math. Anal. Appl., 83 (1981), pp. 495-530.
6. S. BOYD, L.E. GHAOUI, E. FERON, AND V. BALAKRISHNAN, Linear matrix inequalities in system and control theory, SIAM Stud. Appl. Math. 15, SIAM, Philadelphia, 1994.
7. S. DENG AND H. HU, Computable Error Bounds for Semidefinite Programming, Tech. report, Department of Mathematical Sciences, Northern Illinois University, DeKalb, IL, 1996.
8. D. GOLDFARB AND K. SCHEINBERG, On parametric semidefinite programming, Appl. Numer. Math., 29 (1999), pp. 361-377.
9. C. HELMBERG, F. RENDL, R.J. VANDERBEI, AND H. WOLKOWICZ, An interior-point method for semidefinite programming, SIAM J. Optim., 6 (1996), pp. 342-361.
10. C. HELMBERG, Fixing Variables in Semidefinite Relaxations, Tech. Report SC-gb-43, Konrad-Zuse-Centrum, Berlin, Germany, 1996.
11. A. HOFFMAN, On approximate solutions of systems of linear inequalities, J. Res. Nat. Bur. Standards, 49 (1952), pp. 263-265.
12. D. KLATTE AND W. LI, Asymptotic Constraint Qualifications and Global Error Bounds for Convex Inequalities, Tech. report, Department of Mathematics and Statistics, Old Dominion University, Norfolk, VA, 1996.
13. E. DE KLERK, Interior Point Methods for Semidefinite Programming, Ph.D. thesis, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands, 1997.
14. M. KOJIMA, S. SHINDOH, AND S. HARA, Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices, SIAM J. Optim., 7 (1997), pp. 86-125.
15. K. KORTANEK AND Q. ZHANG, Perfect Duality in Semi-Infinite and Semidefinite Programming, Tech. report, Department of Management Sciences, University of Iowa, Iowa City, IA, 1997.
16. A. LEWIS, Eigenvalue-constrained faces, Linear Algebra Appl., 269 (1998), pp. 159-181.
17. X.-D. LUO AND Z.-Q. LUO, Extension of Hoffman's error bound to polynomial systems, SIAM J. Optim., 4 (1994), pp. 383-392.
18. Z.-Q. LUO AND J.-S. PANG, Error bounds for analytic systems and their applications, Math. Programming, 67 (1994), pp. 1-28.
19. Z.-Q. LUO AND J. STURM, Error bounds for quadratic systems, in High Performance Optimization, J. Frenk, C. Roos, T. Terlaky, and S. Zhang, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000, pp. 383-404.
20. Z.-Q. LUO, J. STURM, AND S. ZHANG, Duality and Self-Duality for Conic Convex Programming, Tech. Report 9620/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands, 1996.
21. Z.-Q. LUO, J. STURM, AND S. ZHANG, Duality results for conic convex programming, Tech. Report 9719/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands, 1997.
22. Z.-Q. LUO, J.F. STURM, AND S. ZHANG, Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming, SIAM J. Optim., 8 (1998), pp. 59-81.
23. Y. NESTEROV AND A. NEMIROVSKII, Interior point polynomial algorithms in convex programming, SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, 1994.
24. Y. NESTEROV AND M. TODD, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res., 22 (1997), pp. 1-42.
25. Y.E. NESTEROV AND M.J. TODD, Primal-dual interior-point methods for self-scaled cones, SIAM J. Optim., 8 (1998), pp. 324-364.
26. J. PANG, Error bounds in mathematical programming, Math. Programming, 97 (1998), pp. 299-332.
27. G. PATAKI, On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues, Math. Oper. Res., 23 (1998), pp. 339-358.
28. M. RAMANA, An exact duality theory for semidefinite programming and its complexity implications, Math. Programming, 77 (1997), pp. 129-162.
29. M.V. RAMANA, L. TUNÇEL, AND H. WOLKOWICZ, Strong duality for semidefinite programming, SIAM J. Optim., 7 (1997), pp. 641-662.
30. R.T. ROCKAFELLAR, Conjugate Duality and Optimization, CBMS-NSF Regional Conf. Ser. Appl. Math., SIAM, Philadelphia, 1974.
31. A. SHAPIRO, First and second order analysis of nonlinear semidefinite programs, Math. Programming, 77 (1997), pp. 301-320.
32. J. STURM, Primal-Dual Interior Point Approach to Semidefinite Programming, Tinbergen Institute Research Series 156, Thesis Publishers, Amsterdam, The Netherlands, 1997.
33. J. STURM AND S. ZHANG, On Sensitivity of Central Solutions in Semidefinite Programming, Tech. Report 9813/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands, 1998.
34. L. VANDENBERGHE AND S. BOYD, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
35. T. WANG AND J. PANG, Global error bounds for convex quadratic inequality systems, Optimization, 31 (1994), pp. 1-12.
36. Y. YE, M. TODD, AND S. MIZUNO, An O(√nL]-iteration homogeneous and self-dual linear programming algorithm, Math. Oper. Res., 19 (1994), pp. 53-67.