The research of a modified primal-dual interior-point algorithm for SDP
From MaRDI portal
Recommendations
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
- A new wide neighborhood infeasible interior-point algorithm for semidefinite programming
- A primal-dual infeasible interior point algorithm for semidefinite programming
- An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization
- A primal-dual interior-point algorithm with arc-search for semidefinite programming
Cited in
(2)
This page was built for publication: The research of a modified primal-dual interior-point algorithm for SDP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2886581)