Pages that link to "Item:Q3562415"
From MaRDI portal
The following pages link to On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization (Q3562415):
Displaying 11 items.
- A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization (Q394386) (← links)
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms (Q457226) (← links)
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
- Stabilization of Mehrotra's primal-dual algorithm and its implementation (Q1771347) (← links)
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones (Q1937004) (← links)
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming (Q1999885) (← links)
- A primal-dual interior-point algorithm with arc-search for semidefinite programming (Q2311204) (← links)
- A new second-order Mehrotra-type predictor-corrector algorithm for SDO (Q2825271) (← links)
- New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming (Q2867429) (← links)
- A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming (Q2921914) (← links)
- Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the Cartesian<b><i>P</i></b><sub>*</sub>(κ)-LCP Over Symmetric Cones (Q4979787) (← links)
