Primal-dual affine-scaling algorithms fail for semidefinite programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1372696
- Affine scaling algorithm fails for semidefinite programming
- Polynomial primal-dual affine scaling algorithms in semidefinite programming
- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
- Polynomial primal-dual cone affine scaling for semidefinite programming
- On the primal-dual affine scaling method
- A primal-dual infeasible interior point algorithm for semidefinite programming
- scientific article; zbMATH DE number 1782596
- An inexact primal-dual algorithm for semi-infinite programming
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
Cited in
(7)- Affine scaling algorithm fails for semidefinite programming
- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
- Polynomial primal-dual cone affine scaling for semidefinite programming
- Polynomial primal-dual affine scaling algorithms in semidefinite programming
- Generalized affine scaling algorithms for linear programming problems
- The solution of Euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction
- scientific article; zbMATH DE number 1372696 (Why is no real title available?)
This page was built for publication: Primal-dual affine-scaling algorithms fail for semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757588)