Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
暂无分享,去创建一个
[1] Erling D. Andersen,et al. On implementing a primal-dual interior-point method for conic quadratic optimization , 2003, Math. Program..
[2] Jacek Gondzio,et al. Reoptimization With the Primal-Dual Interior Point Method , 2002, SIAM J. Optim..
[3] E. Alper Yildirim,et al. Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension , 2008, Comput. Optim. Appl..
[4] Erling D. Andersen,et al. Presolving in linear programming , 1995, Math. Program..
[5] Roy E. Marsten,et al. Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art , 1994, INFORMS J. Comput..
[6] Anthony Vannelli,et al. On Interior-Point Warmstarts for Linear and Combinatorial Optimization , 2010, SIAM J. Optim..
[7] Jacek Gondzio,et al. A warm-start approach for large-scale stochastic linear programs , 2011, Math. Program..
[8] Jos F. Sturm,et al. A Matlab toolbox for optimization over symmetric cones , 1999 .
[9] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[10] Stephen J. Wright,et al. Warm-Start Strategies in Interior-Point Methods for Linear Programming , 2002, SIAM J. Optim..
[11] Jos F. Sturm,et al. Implementation of interior point methods for mixed semidefinite and second order cone optimization problems , 2002, Optim. Methods Softw..
[12] Erling D. Andersen,et al. Markowitz portfolio optimization using MOSEK. MOSEK Technical report: TR-2009-2 , 2012 .
[13] Yinyu Ye,et al. A simplified homogeneous and self-dual linear programming algorithm and its implementation , 1996, Ann. Oper. Res..
[14] Michael J. Todd,et al. Primal-Dual Interior-Point Methods for Self-Scaled Cones , 1998, SIAM J. Optim..
[15] Z. Luo,et al. Conic convex programming and self-dual embedding , 1998 .
[16] Roman A. Polyak,et al. Modified barrier functions (theory and methods) , 1992, Math. Program..
[17] Stephen J. Wright. Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming , 1999, SIAM J. Optim..
[18] Shinji Mizuno,et al. An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm , 1994, Math. Oper. Res..
[19] Donald Goldfarb,et al. Robust Portfolio Selection Problems , 2003, Math. Oper. Res..
[20] Knud D. Andersen,et al. The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm , 2000 .
[21] Nimrod Megiddo,et al. On Finding Primal- and Dual-Optimal Bases , 1991, INFORMS J. Comput..
[22] Sanjay Mehrotra. Handling free variables in interior methods , 1991 .
[23] Michael J. Todd,et al. Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..
[24] Shinji Mizuno,et al. On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..
[25] Yinyu Ye,et al. Interior point algorithms: theory and analysis , 1997 .
[26] David F. Shanno,et al. An exact primal–dual penalty method approach to warmstarting interior-point methods for linear programming , 2007, Comput. Optim. Appl..
[27] Stephen J. Wright. Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.
[28] Hans Frenk,et al. High performance optimization , 2000 .
[29] Sanjay Mehrotra,et al. On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..
[30] Levent Tunçel,et al. Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization , 1998, Math. Oper. Res..
[31] Jacek Gondzio,et al. A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis , 2008, SIAM J. Optim..