Second-order cone programming

Mathematical Programming, Series B

Volumn 95, Issue 1, 2003, Pages 3-51

  Alizadeh, F ^a   Goldfarb, D ^b  

^a the State University of New Jersey   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2342458706     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-002-0339-5     Document Type: Article

References (66)

1. [AA95] I. Adler and F. Alizadeh. Primal-Dual Interior Point Algorithms for Convex Quadratically Constrained and Semidefinite Optimization Problems. Technical Report RRR-111-95, RUTCOR, Rutgers University, 1995.
2. [ACO94] K. D. Andersen, E. Christiansen, and M. L. Overton. Limit Analysis by Minimizing a Sum of Norms. SIAM J. Scient. Comp., 1994.
3. +97] F. Alizadeh, J.-P.A. Haeberly, V. Nayakkankuppam, M.L. Overton, and S.A. Schmieta. SDPPACK User Guide (Version 0.9 Beta). Technical Report 737, Courant Institute of Mathematical Sciences, New York University, New York, NY, 1997. (Available at http://www.cs.nyu.edu/faculty/ overton/sdppack).
4. [AHO97] F. Alizadeh, J.P. Haeberly, and M.L. Overton. Complementarity and nondegeneracy in semidefinite programming. Math. Programming, 77(2), 1997.
5. [AHO98] F. Alizadeh, J.P. Haeberly, and M.L. Overton. Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results. SIAM J. Optim., 8(3):746-768, 1998.
6. [And96] K.D. Andersen. A modified Schur complement method for handling dense columns in interior-point methods for linear programming. ACM Transactions on Mathematical Software, 22:348-356, 1996.
7. [AS97] F. Alizadeh and S.U. Schmieta. Optimization with Semidefinite, Quadratic and Linear Constraints. Technical Report rrr 23-97, RUTCOR, Rutgers University, November 1997. (Available at URL: http://rutcor.rutgers.edu/pub/rrr/ reports97/23.ps).
8. [AS00] F. Alizadeh and S.H. Schmieta. Symmetric Cones, Potential Reduction Methods and Word-By-Word Extensions. In R. Saigal, L. Vandenberghe, and H. Wolkowicz, editors, Handbook of Semidefinite Programming, Theory, Algorithms and Applications, pages 195-233. Kluwer Academic Publishers, 2000.
9. [BFM97] M. Buss, L. Faybusovich, and J.B. More. Recursive algorithms for real-time grasping force optimization. In Proceedings of International Conferences on Robotics and Automation, Albuquerque, NM, USA, 1997.
10. [BGFB94] S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan. Linear Matrix Inequalities in System and Control Theory, volume 15 of SIAM Studies in Applied Mathematics. SIAM, Philadelphia PA, 1994.
11. [BHM96] M. Buss, H. Hashimoto, and J.B. Moore. Dextrous hand grasping force optimization. IEEE Transactions on Robotics and Autimation, 12(3):406-418, June 1996.
12. [BTN92] A. Ben-Tal and A. Nemirovski. Interior point polynomial time methods for truss topology design. Technical Report 3/92, Technion, Haifa, Israel, 1992.
13. [BTN98] A. Ben-Tal and A.S. Nemirovski. Robust convex optimization. Math, of Oper. Res., 23(4):769-805, 1998.
14. [BTN99] A. Ben-Tal and A. Nemirovski. Robust solutions of uncertain linear programs. Oper. Res. Lett., 25(1):1-13, 1999.
15. [BTN01] A. Ben-Tal and A. Nemirovski. On polyhedral approximations of the second order cone. Math. of Oper. Res., 26(2): 193-205, May 2001.
16. [CMS90] I.C. Choi, C.L. Monma, and D. Shanno. Further developments of primal-dual interior point methods. ORSA J. of Computing, 2(4):304-311, 1990.
17. [Fay97a] L. Faybusovich. Euclidean Jordan algebras and interior-point algorithms. Positivity, 1(4):331-357, 1997.
18. [Fay97b] L. Faybusovich. Linear systems in Jordan algebras and primal-dual interior point algorithms. Journal of Computational and Applied Mathematics, 86:149-175, 1997.
19. [Fay98] L. Faybusovich. A Jordan-algebraic approach to potential-reduction algorithms. Technical report, Department of Mathematics, University of Notre Dame, Notre Dame, IN, USA, April 1998.
20. [FK94] J. Faraut and A. Korányi. Analysis on Symmetric Cones. Oxford University Press, Oxford, UK, 1994.
21. T factorizations. Maths. Comp., 29:1067-1087, 1974.
22. [GI01] D. Goldfarb and G. Iyengar. Robust portfolio optimization. Manuscript, 2001.
23. [GL81] A. George and W.-H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, NJ, 1981.
24. [GL96] G. H. Golub and C. F. Van Loan. Matrix Computations, Third ed. Johns Hopkins University Press, Baltimore, MD, third edition, 1996.
25. [GL97] L. El Ghaoui and H. Lebret. Robust solutions to least squares problems with uncertain data. SIAM J. Matrix Anal. Appl., 18(4): 1035-1064, 1997.
26. [GLW91] D. Goldfarb, S. Liu, and S. Wang. A logarithmic barrier function algorithm for convex quadratically constrained convex quadratic programming. SIAM J. Optim., 1(2):252-267, 1991.
27. [GMS75] P.H. Gill, W. Murray, and M.A. Saunders. Methods for computing and modifying the LDV factors of a matrix. Math. of Comp., 29:1051-1077, 1975.
28. [Go176] D. Goldfarb. Factorized variable metric methods for unconstrained optimization. Math. of Comp., 30:796-811, 1976.
29. [GS01a] D. Goldfarb and K. Scheinberg. A product-form Cholesky factorization implementation of interior point methods for SOCP. Manuscript, 2001.
30. [GS01b] D. Goldfarb and K. Scheinberg. A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming. Manuscript, 2001.
31. [GS01c] D. Goldfarb and K. Scheinberg. An unsymmetric product-form factorization for interior point methods in SOCP. Manuscript, 2001.
32. [Hig96] N.J. Higham. Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia, PA, 1996.
33. [HRVW96] C. Helmberg, F. Rendl, R.J. Vanderbei, and H. Wolkowicz. An interior-point method for semidefinite programming. SIAM J. Optim., 6:342-361, 1996.
34. [IC01] G. Iyengar and M.T. Çezik. Cut generation for mixed 0-1 quadratically constrained programs. IEOR Department, Columbia University, New York NY, 2001.
35. [Jar91] F. Jarre. On the convergence of the method of analytic centers when applied to convex quadratic programs. Math. Programming, 49(3):341-358, 1991.
36. [Kar84] N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4:373-395, 1984.
37. [KK01] S. Kim and M. Kojima. Second order cone programming relaxations of nonconvex quadratic optimization problems. Optim. Methods Softw., 15(3-4):201-224, 2001.
38. [KMY89] M. Kojima, S. Mizuno, and A. Yoshise. A primal-dual interior-point algorithm for linear programming. In N. Megiddo, editor, Progress in Mathematical Programming, Berlin, 1989. Springer Verlag.
39. [KSH97] M. Kojima, S. Shindoh, and S. Hara. Interior-point methods for the monotone linear complementarity problem in symmetric matrices. SIAM J. Optim., 7(9):86-125, 1997.
40. [LB97] H. Lebret and S. Boyd. Antenna array pattern synthesis via convex optimization. SIAM J. Matrix Anal. Appl., 45(3):526-512, 1997.
41. [LVBL98] M. S. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret. Applications of second order cone programming. Linear Algebra Appl., 284:193-228, 1998.
42. [MA89] R.D.C. Monteiro and I. Adler. Interior path following primal-dual algorithms. Part I: Linear programming. Math. Programming, 44:27-41, 1989.
43. [Mon97] R.D.C. Monteiro. Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim., 7:663-678, 1997.
44. [Mon98] R.D.C. Monteiro. Polynomial convergence of primal-dual algorithms for semidefinite programming based on monteiro and zhang family of directions. SIAM J. Optim., 8:797-812, 1998.
45. [MS91] S. Mehrotra and J. Sun. A method of analytic centers for quadratically constrianed convex quadratic programming. SIAM Journal on Numerical Analysis, 28(2):529-544, 1991.
46. [MT00] R.D.C. Monteiro and T. Tsuchiya. Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions. Mathematical Programming, 88:61-83, 2000.
47. [MZ98] R.D.C. Monteiro and Y. Zhang. A unified analysis for a class of path-following primal-dual interior-point algorithms for semidefinite programming. Mathematical Programming, 81:281-299, 1998.
48. [Nem99] A. Nemirovski. What can be expressed via conic quadratic and semidefinite programming?, August 1999. Talk presented at RUTCOR weekly seminar.
49. [NN94] Y. Nesterov and A. Nemirovski. Interior Point Polynomial Methods in Convex Programming: Theory and Applications. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 1994.
50. [NS96] A. Nemirovski and K. Scheinberg. Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic programming. Math. Programming, 72:273-289, 1996.
51. [NT97] Y.E. Nesterov and M.J. Todd. Self-scaled barriers and interior-point methods for convex programming. Math. of Oper. Res., 22:1-42, 1997.
52. [NT98] Y.E. Nesterov and M.J. Todd. Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim., 8:324-364, 1998.
53. [Pat96] G. Pataki. Cone LP's and Semidefinite Programs: Geometry and a Simplex-type Method. In proceedings of the fifth Integer Programming and Combinatorial Optimization (IPCO) conference, 1996.
54. [SA99] S.H. Schmieta and F. Alizadeh. Extension of Commutative Class of Primal-Dual Interior Point Algorithms to Symmetric Cones. Technical Report RRR 13-99, RUTCOR, Rutgers University, August 1999. (Available from http://rutcor.rutgers.edu/pub/rrr/reports99/13.ps. Submitted to Math Programming).
55. [SA01] S.H. Schmieta and F. Alizadeh. Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones. Math. of Oper. Res., 26(3):543-564, 2001.
56. [Sch99] S.H. Schmieta. Application of Jordan algebras to the design and analysis of interior-point algorithms for linear, quadratically constrained quadratic, and semi-definite programming. PhD thesis, Rutgers Center for Operations Research, Rutgers University, 1999.
57. [Stu98] J.F. Sturm. Using SeDuMi I.Ox, a MATLAB toolbox for optimization over symmetric cones. Manuscript, (available at http://www.unimass.nl/~sturm), August 1998.
58. [Stu99] J.F. Sturm. Similarity and other spectral relations for symmetric cones. Technical report, Department of Quantative Economics, Maastricht University, The Netherlands, April 1999.
59. [Tsu97] T. Tsuchiya. A Polynomial Primal-Dual Path-Following Algorithm for Second-Order Cone Programming. Technical Report No. 649, The Institute of Statistical Mathematics, Tokyo, Japan, 1997.
60. [Tsu99] T. Tsuchiya. A convergence analysis of the scaling-invariant primal-dual path- following algorithms for second-order cone programming. Optim. Methods Softw., 11:141-182, 1999.
61. [VB96] L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38(1):49-95, 1996.
62. [WBV98] S.-P. Wu, S. Boyd, and L. Vandenberghe. FIR filter design via spectral factorization and convex optimization. In Biswa Datta, editor, Applied and Computational Control, Signals and Circuits, chapters. Birkhauser, 1998.
63. [Wit64] C. Witzgall. Optimal location of a central facility, mathematical models and concepts. Technical Report 8388, National Bureau of Standards, Washington, DC, 1964.
64. [Wri97] S.J. Wright. Primal-Dual Interior Point Methods. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1997.
65. [XY97] G.L. Xue and Y.Y.Ye. An efficient algorithm for minimizing a sum of euclidean norms with applications. SIAM J. Optim., 7:1017-1036, 1997.
66. [Zha98] Y. Zhang. On extending primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim., 8:356-386, 1998.