Ill-posedness and finite precision arithmetic: a complexity analysis for interior point methods
暂无分享,去创建一个
[1] J. Renegar. Some perturbation theory for linear programming , 1994, Math. Program..
[2] James Renegar,et al. Incorporating Condition Measures into the Complexity Theory of Linear Programming , 1995, SIAM J. Optim..
[3] 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..
[4] C. Roos,et al. On the classical logarithmic barrier function method for a class of smooth convex programming problems , 1992 .
[5] Jorge R. Vera. Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs , 1996, SIAM J. Optim..
[6] O. Mangasarian,et al. Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems , 1987 .
[7] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[8] Stephen Smale,et al. Some Remarks on the Foundations of Numerical Analysis , 1990, SIAM Rev..
[9] Dick den Hertog,et al. Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity , 1994 .
[10] J. H. Wilkinson. The algebraic eigenvalue problem , 1966 .
[11] James Renegar,et al. Linear programming, complexity theory and elementary functional analysis , 1995, Math. Program..
[12] Jorge Rafael,et al. Ill-posedness in mathematical programming and problem-solving with approximate data , 1992 .
[13] B. Craven. Control and optimization , 2019, Mathematical Modelling of the Human Cardiovascular System.