Towards non-symmetric conic optimization

Optimization Methods and Software

Volumn 27, Issue 4-5, 2012, Pages 893-917

  Nesterov, Yurii ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

affine scaling direction; conic problems; convex optimization; interior point methods; long step path following methods; p norm minimization; self concordant barriers; self scaled barriers

Indexed keywords

AFFINE-SCALING DIRECTION; CONIC PROBLEMS; INTERIOR-POINT METHOD; PATH-FOLLOWING METHOD; SELF-CONCORDANT BARRIERS; SELF-SCALED BARRIERS;

CONVEX OPTIMIZATION;

OPTIMIZATION;

EID: 84862676727     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556788.2011.567270     Document Type: Article

References (14)

1. F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim. 5 (1995), pp. 13-51.
2. R.W. Freund, F. Jarre, and S. Schaible, On self-concordant barrier functions for conic hulls and fractional programming, Math. Program. 74 (1996), pp. 237-246.
3. O. Guler, Hyperbolic polynomials and interior point methods for convex programming, Math. Oper. Res. 22 (1997), pp. 350-377.
4. A. Nemirovski, Polynomial-Time methods in convex programming, in The Mathematics of Numerical Analysis, J. Renegar, M. Shub, and S. Smale, eds., Lectures in Applied Mathematics, Vol. 32, American Mathematical Society, Providence, 1996.
5. A. Nemirovski and L. Tuncel, Cone-free path-following and potential reduction polynomial time interior-point algorithms, Math. Program. 102 (2005), pp. 261-295.
6. Yu. Nesterov, Long-step strategies in interior-point primal-dual methods, Math. Program. 76(1) (1996), 47-94.
7. Yu. Nesterov, Introductory Lectures on Convex Optimization, Kluwer, Boston, 2004.
8. Yu. Nesterov andA. Nemirovsky, InteriorPointPolynomial Algorithms in ConvexProgramming, SIAM, Philadelphia, 1994.
9. Yu. Nesterov and M.J. Todd, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res. 22(1) (1997), pp. 1-42.
10. Yu. Nesterov and M.J. Todd, Primal-dual interior-point methods for self-scaled cones, SIAM J. Optim. 8 (1998), pp. 324-364.
11. J. Renegar, A Mathematical View of Interior-Point Methods in Convex Optimization, MPS/SIAM Series on Optimization 3, SIAM Publications, Philadelphia, 2001.
12. M.J. Todd, K.C. Toh, and R.H. Tutuncu, On the Nesterov-Todd direction in semidefinite programming, SIAM Journal on Optimization 8 (1998), pp. 769-796.
13. L. Tuncel, Generalization of primal-dual interior-point methods to convex optimization problems in conic form, Found. Comput. Math. 1 (2001), pp. 229-254.
14. G. Xue andY.Ye, An efficient algorithm for minimizing a sum of p-norms, SIAM J. Optim. 10(2) (1998), pp. 551-579.