On an Extension of Condition Number Theory to Nonconic Convex Optimization
暂无分享,去创建一个
[1] Robert M. Freund,et al. Opera Tions Research Center Working Paper Condition-measure Bounds on the Behavior of the Central Trajectory of a Semi-definite Program , 2022 .
[2] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[3] Fernando Ordóñez,et al. On the explanatory value of condition numbers for convex optimization : theoretical issues and computational experience , 2002 .
[4] Robert M. Freund,et al. A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems , 2002, SIAM J. Optim..
[5] Sharon Filipowski,et al. On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data , 1999, SIAM J. Optim..
[6] Fernando Ordonez,et al. On an Extension of Condition Number Theory to Non-Conic Convex Optimization , 2003 .
[7] Felipe Cucker,et al. A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine , 2002, SIAM J. Optim..
[8] Fernando Ordóñez,et al. Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization , 2003, SIAM J. Optim..
[9] James Renegar,et al. Linear programming, complexity theory and elementary functional analysis , 1995, Math. Program..
[10] J. Renegar. Some perturbation theory for linear programming , 1994, Math. Program..
[11] Sharon Filipowski. On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data , 1997, Math. Oper. Res..
[12] Jorge R. Vera,et al. On the complexity of linear programming under finite precision arithmetic , 1998, Math. Program..
[13] Jorge R. Vera. Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs , 1996, SIAM J. Optim..
[14] Robert M. Freund,et al. On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System , 2003, Math. Oper. Res..
[15] Robert M. Freund,et al. Condition measures and properties of the central trajectory of a linear program , 1998, Math. Program..
[16] J. Pe. Computing the Distance to Infeasibility: Theoretical and Practical Issues , 1998 .
[17] Robert M. Freund,et al. Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system , 1999, Math. Program..
[18] Katta G. Murty,et al. Nonlinear Programming Theory and Algorithms , 2007, Technometrics.
[19] James Renegar,et al. Computing approximate solutions for convex conic systems of constraints , 2000, Math. Program..
[20] Robert M. Freund,et al. Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm , 1999, SIAM J. Optim..
[21] Jorge Rafael,et al. Ill-posedness in mathematical programming and problem-solving with approximate data , 1992 .
[22] Jean-Louis Goffin,et al. The Relaxation Method for Solving Systems of Linear Inequalities , 1980, Math. Oper. Res..