Extension of the LP-Newton method to conic programming problems via semi-infinite representation
From MaRDI portal
Publication:2225528
DOI10.1007/s11075-020-00933-6zbMath1464.90102arXiv1902.01004OpenAlexW3019171275MaRDI QIDQ2225528
Publication date: 8 February 2021
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.01004
Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Semi-infinite programming (90C34)
Uses Software
Cites Work
- Solving semidefinite-quadratic-linear programs using SDPT3
- Zonotopes and the LP-Newton method
- Semi-infinite programming
- Smoothing algorithms for complementarity problems over symmetric cones
- Applications of second-order cone programming
- Non-interior continuation methods for solving semidefinite complementarity problems
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- An extension of Chubanov's algorithm to symmetric cones
- A simple projection algorithm for linear programming problems
- Two-phase simplex method for linear semidefinite optimization
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- The LP-Newton method for standard form linear programming problems
- Lectures on Modern Convex Optimization
- Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite optimization
- A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
- Finding the nearest point in A polytope
- An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A pivoting procedure for a class of second-order cone programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
