Largest dual ellipsoids inscribed in dual cones
暂无分享,去创建一个
[1] Osman Güler,et al. Hyperbolic Polynomials and Interior Point Methods for Convex Programming , 1997, Math. Oper. Res..
[2] S. M. Robinson. Bounds for error in the solution set of a perturbed linear program , 1973 .
[3] James Renegar,et al. Linear programming, complexity theory and elementary functional analysis , 1995, Math. Program..
[4] Michael J. Todd,et al. Scaling, shifting and weighting in interior-point methods , 1994, Comput. Optim. Appl..
[5] J. Renegar. Some perturbation theory for linear programming , 1994, Math. Program..
[6] R. Freund,et al. On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization , 2001 .
[7] Robert M. Freund,et al. Complexity of convex optimization using geometry-based measures and a reference point , 2015, Math. Program..
[8] Osman Güler,et al. Barrier Functions in Interior Point Methods , 1996, Math. Oper. Res..
[9] Arkadi Nemirovski,et al. Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.
[10] Donald Goldfarb,et al. Second-order cone programming , 2003, Math. Program..
[11] Michael J. Todd,et al. Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..
[12] Stephen M. Robinson,et al. Normal Maps Induced by Linear Transformations , 1992, Math. Oper. Res..
[13] J. Faraut,et al. Analysis on Symmetric Cones , 1995 .
[14] Alexander Shapiro,et al. On Eigenvalue Optimization , 1995, SIAM J. Optim..
[15] Robert M. Freund,et al. On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization , 2001, SIAM J. Optim..
[16] Michael J. Todd,et al. Primal-Dual Interior-Point Methods for Self-Scaled Cones , 1998, SIAM J. Optim..