Interior-Point Polynomial Algorithms in Convex Programming (Y. Nesterov and A. Nemirovskii)
Yinyu Ye · SIAM Review · 1994
Previous article Next article Interior-Point Polynomial Algorithms in Convex Programming (Y. Nesterov and A. Nemirovskii)Yinyu YeYinyu Yehttps://doi.org/10.1137/1036175PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout"Interior-Point Polynomial Algorithms in Convex Programming (Y. Nesterov and A. Nemirovskii)." SIAM Review, 36(4), pp. 682–683[1] O. Güler, Barrier functions in interior-point methods, 1994, manuscript, Department of Mathematics, University of Maryland, Baltimore County, Baltimore, Maryland Google Scholar[2] K. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, 4 (1984), 373–395 86i:90072 0557.90065 CrossrefISIGoogle Scholar[3] K. O. Kortanek, A testimonial, 1994, private communication, Department of Management Science, University of Iowa, Iowa City, Iowa Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Ordinal space projection learning via neighbor classes representationComputer Vision and Image Understanding, Vol. 174 Cross Ref First-Order Algorithm for Content-Centric Sparse Multicast Beamforming in Large-Scale C-RANIEEE Transactions on Wireless Communications, Vol. 17, No. 9 Cross Ref On pricing approximate queriesInformation Sciences, Vol. 453 Cross Ref Reconstruction-based supervised hashingPattern Recognition, Vol. 79 Cross Ref A Two-Phase Space Resection Model for Accurate Topographic Reconstruction from Lunar Imagery with PushbroomScanners11 April 2016 | Sensors, Vol. 16, No. 4 Cross Ref Volume 36, Issue 4| 1994SIAM Review History Published online:03 August 2006 InformationCopyright © 1994 © Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1036175Article page range:pp. 682-683ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics