Pages that link to "Item:Q5949888"
From MaRDI portal
The following pages link to New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction (Q5949888):
Displaying 6 items.
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535) (← links)
- A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions (Q627154) (← links)
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path (Q721594) (← links)
- Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function (Q1733331) (← links)
- A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity (Q2895762) (← links)
- A note on the Nesterov-Todd and the Kojima-Shindoh-hara search directions in semidefinite programming (Q4504775) (← links)