Pages that link to "Item:Q3066932"
From MaRDI portal
The following pages link to A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming (Q3066932):
Displaying 24 items.
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming (Q493049) (← links)
- An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization (Q520262) (← links)
- Symmetric primal-dual path-following algorithms for semidefinite programming (Q1294556) (← links)
- Interior-point algorithms for semidefinite programming based on a nonlinear formulation (Q1610312) (← links)
- Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions (Q1697897) (← links)
- A new second-order corrector interior-point algorithm for semidefinite programming (Q1935927) (← links)
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming (Q1999885) (← links)
- A wide neighborhood interior-point algorithm based on the trigonometric kernel function (Q2053067) (← links)
- A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood (Q2221151) (← links)
- A primal-dual interior-point algorithm with arc-search for semidefinite programming (Q2311204) (← links)
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming (Q2348957) (← links)
- New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming (Q2867429) (← links)
- The research of a modified primal-dual interior-point algorithm for SDP (Q2886581) (← links)
- A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming (Q2921914) (← links)
- A note on a wide neighborhood infeasible interior-point algorithm for semidefinite programming (Q2951648) (← links)
- A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log <i>ϵ</i><sup>−1</sup>) iteration complexity (Q3174878) (← links)
- Primal--Dual Path-Following Algorithms for Semidefinite Programming (Q4377581) (← links)
- A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization (Q4633251) (← links)
- Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision (Q4943940) (← links)
- Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems (Q4946709) (← links)
- An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood (Q5031228) (← links)
- An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming (Q5169450) (← links)
- A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization (Q5238196) (← links)
- Interior-point algorithm for linear programming based on a new descent direction (Q6140958) (← links)
