Primal Newton method for the linear cone programming problem
From MaRDI portal
Publication:1644012
DOI10.1134/S0965542518020173zbMath1397.90269OpenAlexW2789468403WikidataQ130120955 ScholiaQ130120955MaRDI QIDQ1644012
Publication date: 21 June 2018
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542518020173
Related Items (1)
Cites Work
- Applications of second-order cone programming
- Second-order cone programming
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Cone-LP's and semidefinite programs: Geometry and a simplex-type method
- A pivoting procedure for a class of second-order cone programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Primal Newton method for the linear cone programming problem