On the behavior of the homogeneous self-dual model for conic convex optimization

Mathematical Programming

Volumn 106, Issue 3, 2006, Pages 527-545

  Freund, Robert M ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Conic Optimization; Convex Cone; Convex Optimization; Duality; Level Sets; Self Dual Embedding; self scaled Cone

Indexed keywords

LOGIC PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

CONIC OPTIMIZATION; CONVEX CONES; CONVEX OPTIMIZATION; DUALITY; LEVEL SETS; SELF-DUAL EMBEDDING; SELF-SCALED CONE;

OPTIMIZATION;

EID: 33644544399     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-005-0667-3     Document Type: Article

References (19)

1. Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optimization 5 (1), 13-51 (1995)
2. Cai, Z., Freund, R.M.: On two measures of problem complexity and their explanatory value for the performance of SeDuMi on second-order cone problems. MIT Operations Research Center Working Paper OR-371-04. To appear in Computational Optimization and Applications
3. Freund, R.M.: On the primal-dual geometry of level sets in linear and conic optimization. SIAM J. Optimization 13 (4), 1004-1013 (2003)
4. Freund, R.M., Vera, J.R.: Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system. Math. Program. 86, 225-260 (1999)
5. de Klerk, E., Roos, C., Terlaky, T.: Initialization in semidefinite programming via a self-dual, skew-symmetric embedding. Oper. Res. Lett. 20 (5), 213-221 (1997)
6. de Klerk, E., Roos, C., Terlaky, T.: Infeasible-start semidefinite programming algorithms via self-dual embeddings. Fields Institute Communications (18), American Mathematical Society, H. Wolkowicz, P.M. Pardalos (eds.), Topics in Semidefinite and Interior Point Methods, 1998, pp. 215-237
7. de Klerk, E., Roos, C., Terlaky, T.: Self-dual embeddings. In: Handbook of Semidefinite Programming H. Wolkowicz, R. Saigal, L. Vandenberghe, (eds.), Kluwer Academic Publishers, 2000, pp. 111-138
8. Luo, Z.-Q., Sturm, J.F., Zhang, S.: Duality and self-duality for conic convex programming. Technical Report, Erasmus University Rotterdam, The Netherlands, March 1996
9. Nesterov, Y.: Long-step strategies in interior-point primal-dual methods. Math. Program. 76, 47-94 (1996)
10. Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 1994
11. Nesterov, Y., Todd, M.J., Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22, 1-42 (1997)
12. Nesterov, Y., Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optimization 8, 324-364 (1998)
13. Potra, F.A., Sheng, R.: On homogeneous interior-point algorithms for semidefinite programming. Optimization Meth. Software 9, 161-184 (1998)
14. Renegar, J.: Some perturbation theory for linear programming. Math. Program. 65 (1), 73-91 (1994)
15. Sturm, J.F.: Implementation of interior point methods for mixed semidefinite and second order cone optimization problems. Optimization Meth. Software 17 (6), 1105-1154 (2002)
16. Todd, M.J., Ye, Y.: A centered projective algorithm for linear programming. Math. Oper. Res. 15, 508-529 (1990)
17. Xu, X., Hung, P.-F., Ye, Y.: A simplified homogeneous and self-dual linear programming algorithm and its implementation. Ann. Oper. Res. 62, 151-171 (1996)
18. Ye, Y., Todd, M.J., Mizuno, S.: An O(√nL)-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19, 53-67 (1994)
19. Zhu, X., Peng, J., Terlaky, T., Zhang, G.: On implementing self-regular proximity based feasible IPMs. McMaster University Advanced Optimization Laboratory AdvOL-Report 2004/3, April 2004