An inexact augmented Lagrangian method for second-order cone programming with applications
From MaRDI portal
Abstract: In this paper, we adopt the augmented Lagrangian method (ALM) to solve convex quadratic second-order cone programming problems (SOCPs). Fruitful results on the efficiency of the ALM have been established in the literature. Recently, it has been shown in [Cui, Sun, and Toh, {em Math. Program.}, 178 (2019), pp. 381--415] that if the quadratic growth condition holds at an optimal solution for the dual problem, then the KKT residual converges to zero R-superlinearly when the ALM is applied to the primal problem. Moreover, Cui, Ding, and Zhao [{em SIAM J. Optim.}, 27 (2017), pp. 2332-2355] provided sufficient conditions for the quadratic growth condition to hold under the metric subregularity and bounded linear regularity conditions for solving composite matrix optimization problems involving spectral functions. Here, we adopt these recent ideas to analyze the convergence properties of the ALM when applied to SOCPs. To the best of our knowledge, no similar work has been done for SOCPs so far. In our paper, we first provide sufficient conditions to ensure the quadratic growth condition for SOCPs. With these elegant theoretical guarantees, we then design an SOCP solver and apply it to solve various classes of SOCPs, such as minimal enclosing ball problems, classical trust-region subproblems, square-root Lasso problems, and DIMACS Challenge problems. Numerical results show that the proposed ALM based solver is efficient and robust compared to the existing highly developed solvers, such as Mosek and SDPT3.
Recommendations
- Augmented Lagrangian method for second-order cone programs under second-order sufficiency
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
- An alternating direction method for second-order conic programming
- Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones
- Augmented Lagrangian methods for convex matrix optimization problems
Cites work
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 7306909 (Why is no real title available?)
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- A second-order cone based approach for solving the trust-region subproblem and its variants
- A simple characterization of solutions sets of convex programs
- Applications of second-order cone programming
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Characterization of metric regularity of subdifferentials
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems
- Convex Analysis
- Derivative-free filter simulated annealing method for constrained continuous global optimization
- Efficient algorithms for the smallest enclosing ball problem
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
- Geometric measure theory.
- Interior point methods for second-order cone programming and OR applications
- Metric subregularity and/or calmness of the normal cone mapping to the \(p\)-order conic constraint system
- Monotone Operators and the Proximal Point Algorithm
- On implementing a primal-dual interior-point method for conic quadratic optimization
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- On the coderivative of the projection operator onto the second-order cone
- Perturbation analysis of second-order cone programming problems
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
- Second order cone programming approaches for handling missing and uncertain data
- Second-order Cone Programming Methods for Total Variation-Based Image Restoration
- Second-order cone programming
- Second-order variational analysis in second-order cone programming
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
- Smoothing functions for second-order-cone complementarity problems
- Solving Second Order Cone Programming via a Reduced Augmented System Approach
- Solving semidefinite-quadratic-linear programs using SDPT3
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Upper bound limit analysis using simplex strain elements and second-order cone programming
Cited in
(10)- An inexact Halpern iteration with application to distributionally robust optimization
- A scale-invariant relaxation in low-rank tensor recovery with an application to tensor completion
- On the convergence properties of a second-order augmented Lagrangian method for nonlinear programming problems with inequality constraints
- scientific article; zbMATH DE number 7652682 (Why is no real title available?)
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- Augmented Lagrangian method for second-order cone programs under second-order sufficiency
- Local convergence of exact and inexact augmented Lagrangian methods under the second-order sufficient optimality condition
- An augmented Lagrangian method exploiting an active-set strategy and second-order information
- Smooth-like lower order penalty approach for solving second-order cone mixed complementarity problems
- An accelerated proximal alternating direction method of multipliers for optimal decentralized control of uncertain systems
This page was built for publication: An inexact augmented Lagrangian method for second-order cone programming with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5003212)
