On the second-order feasibility cone: Primal-dual representation and efficient projection

SIAM Journal on Optimization

Volumn 19, Issue 3, 2008, Pages 1073-1092

  Belloni, Alexandre ^a   Freund, Robert M ^b  

^a DUKE UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Computational complexity; Convex cone; Newton method; Projection; Second order cone

Indexed keywords

ARBITRARY POINTS; COMPUTATIONAL TESTS; CONVEX CONE; MATRIX; NEWTON METHOD; PERCEPTRON ALGORITHMS; PRIMAL-DUAL; PROJECTION; SECOND ORDERS; SECOND-ORDER CONE; SPECTRAL DECOMPOSITION;

COMPUTATIONAL METHODS; CONES; NEWTON-RAPHSON METHOD;

COMPUTATIONAL COMPLEXITY;

EID: 69649097969     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/06067198X     Document Type: Article

References (10)

1. F. Alizadeh, J.-P. 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. A. Belloni, R. M. Freund, and S. Vempala, Efficiency of a Re-scaled Perceptron Algorithm for Conic Systems, Working paper OR 379-06, MIT Operations Research Center, Cambridge, MA, 2006.
3. A. BERMAN, Cones, Matrices, and Mathematical Programming, Springer-Verlag, New York, 1973.
4. A. Melman, A unifying convergence analysis of second-order methods for secular equations, Math. Comp., 66 (1997), pp. 333-344.
5. G. Pataki, On the closedness of the linear image of a closed convex cone, Math. Oper. Res., 32 (2007), pp. 395-412.
6. J. Renegar, A Mathematical View of Interior-Point Methods in Convex Optimization, SIAM, Philadelphia, 2001.
7. R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
8. S. Smale, Newton's method estimates from data at one point, in The Merging of Disciplines: New Directions in Pure, Applied and Computational Mathematics, R. Ewing, K. Gross, and C. Martin, eds., Springer-Verlag, New York, 1986, pp. 185-196.
9. J. Sturm, Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones, Optim. Methods Softw., 11 and 12 (1999), pp. 625-653.
10. Y. Ye, A new complexity result for minimizing a general quadratic function with a sphere constraint, in Recent Advances in Global Optimization, C. Floudas and P. Pardalos, eds., Princeton University Press, Princeton, NJ, 1992, pp. 19-31.