Pages that link to "Item:Q2762830"

The following pages link to Superlinear convergence of a predictor-corrector method for semidefinite programming without shrinking central path neighborhood (Q2762830):

Displaying 9 items.

• A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence (Q306395) (← links)
• A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
• Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020) (← links)
• Analyticity of weighted central paths and error bounds for semidefinite programming (Q948959) (← links)
• On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence (Q1582351) (← links)
• Strong duality and minimal representations for cone optimization (Q1928754) (← links)
• Generating and measuring instances of hard semidefinite programs (Q1960189) (← links)
• Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems (Q3465241) (← links)
• On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming (Q4943613) (← links)