Extension of the LP-Newton method to conic programming problems via semi-infinite representation
From MaRDI portal
(Redirected from Publication:2225528)
Abstract: The LP-Newton method solves the linear programming problem (LP) by repeatedly projecting a current point onto a certain relevant polytope. In this paper, we extend the algorithmic framework of the LP-Newton method to the second-order cone programming problem (SOCP) via a linear semi-infinite programming (LSIP) reformulation of the given SOCP. In the extension, we produce a sequence by projection onto polyhedral cones constructed from LPs obtained by finitely relaxing the LSIP. We show the global convergence property of the proposed algorithm under mild assumptions, and investigate its efficiency through numerical experiments comparing the proposed approach with the primal-dual interior-point method for the SOCP.
Recommendations
- A semismooth Newton method for nonlinear symmetric cone programming
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
- New constraint qualification and optimality for linear semi-infinite programming
- An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition
- scientific article; zbMATH DE number 1215251
- Extended semismooth Newton method for functions with values in a cone
- Extended Newton methods for conic inequalities: approximate solutions and the extended Smale -theory
- scientific article; zbMATH DE number 3950219
- An extension of the simplex algorithm for semi-infinite linear programming
Cites work
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- A pivoting procedure for a class of second-order cone programming
- A simple projection algorithm for linear programming problems
- An extension of Chubanov's algorithm to symmetric cones
- An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming
- Applications of second-order cone programming
- Finding the nearest point in A polytope
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- 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
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming
- Semidefinite optimization
- Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
- Smoothing algorithms for complementarity problems over symmetric cones
- Solving semidefinite-quadratic-linear programs using SDPT3
- The LP-Newton method for standard form linear programming problems
- Two-phase simplex method for linear semidefinite optimization
- Zonotopes and the LP-Newton method
Cited in
(3)
This page was built for publication: Extension of the LP-Newton method to conic programming problems via semi-infinite representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225528)
