Advanced search
Publication Cover
Optimization Methods and Software Volume 27, 2012 - Issue 4-5: Special issue in honour of Professor Florian A. Potra's 60th birthday
Submit an article Journal homepage
515
Views
28
CrossRef citations to date
0
Altmetric
Original Articles

Towards non-symmetric conic optimization

Yurii Nesterov Center for Operations Research and Econometrics (CORE), Catholic University of Louvain (UCL), 34 voie du Roman Pays, 1348, Louvain-la-Neuve, BelgiumCorrespondence[email protected]
Pages 893-917 | Received 25 Feb 2011, Accepted 25 Feb 2011, Published online: 13 Oct 2011

References

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

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.