Pages that link to "Item:Q1582351"
From MaRDI portal
The following pages link to On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence (Q1582351):
Displaying 10 items.
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
- Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020) (← links)
- Superlinear convergence of interior-point algorithms for semidefinite programming (Q1273164) (← links)
- Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming (Q1434073) (← links)
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (Q1935573) (← links)
- Superlinear convergence of a predictor-corrector method for semidefinite programming without shrinking central path neighborhood (Q2762830) (← links)
- On the Turing model complexity of interior point methods for semidefinite programming (Q2821802) (← links)
- A class of polynomial primal-dual interior-point algorithms for semidefinite optimization (Q3415567) (← links)
- Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems (Q3465241) (← links)
- On long-step predictor-corrector interior-point algorithm for semidefinite programming with Monteiro-Zhang unified search directions (Q4504776) (← links)
