Primal Central Paths and Riemannian Distances for Convex Sets
暂无分享,去创建一个
[1] Michael J. Todd,et al. Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems , 1999, Math. Program..
[2] S. Helgason. Differential Geometry and Symmetric Spaces , 1964 .
[3] O. Rothaus. Domains of Positivity , 1958 .
[4] M. Koecher,et al. Positivitatsbereiche Im R n , 1957 .
[5] Ming Gu,et al. Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision , 1999, SIAM J. Optim..
[6] Stephen J. Wright. Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.
[7] Yurii Nesterov,et al. Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.
[8] Alan Edelman,et al. The Geometry of Algorithms with Orthogonality Constraints , 1998, SIAM J. Matrix Anal. Appl..
[9] K. Tanabe. A geometric method in nonlinear programming , 1980 .
[10] Michael J. Todd,et al. On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods , 2002, Found. Comput. Math..