Pages that link to "Item:Q2867429"
From MaRDI portal
The following pages link to New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming (Q2867429):
Displaying 4 items.
- On the extension of an arc-search interior-point algorithm for semidefinite optimization (Q1713225) (← links)
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming (Q1999885) (← links)
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization (Q2346399) (← links)
- Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term (Q2353462) (← links)
