scientific article; zbMATH DE number 1372699
From MaRDI portal
Publication:4703909
interior-point methodspath-following methodspolynomial complexityprimal-dual methodssemidefinite programming
Numerical mathematical programming methods (65K05) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Optimality conditions and duality in mathematical programming (90C46) Interior-point methods (90C51) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions
- Polynomial convergence of primal-dual algorithms for SDP based on the KSH family of directions
- Polynomial convergence of primal-dual algorithms for SDLCP based on the M-Z family of directions
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
Cited in
(6)- Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions
- Superlinear Convergence of an Infeasible Predictor-Corrector Path-Following Interior Point Algorithm for a Semidefinite Linear Complementarity Problem Using the Helmberg–Kojima–Monteiro Direction
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- A note on the Nesterov-Todd and the Kojima-Shindoh-hara search directions in semidefinite programming
- Polynomial convergence of primal-dual algorithms for SDP based on the KSH family of directions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4703909)
