The rate of convergence of proximal method of multipliers for second-order cone optimization problems
From MaRDI portal
Publication:828665
DOI10.1007/s11590-020-01607-xzbMath1466.90098OpenAlexW3035224056MaRDI QIDQ828665
Bo Wang, Li Chu, Hong-Wei Zhang, Li-wei Zhang
Publication date: 5 May 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01607-x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems
- Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones
- Applications of second-order cone programming
- Second-order cone programming
- The rate of convergence of proximal method of multipliers for equality constrained optimization problems
- A homotopy method for nonlinear second-order cone programming
- New constraint qualifications and optimality conditions for second order cone programs
- On the existence of saddle points for nonlinear second-order cone programming problems
- Multiplier and gradient methods
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- Differentiable Exact Penalty Functions for Nonlinear Second-Order Cone Programs
- On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
- The rate of convergence of proximal method of multipliers for nonlinear semidefinite programming
- A feasible direction algorithm for nonlinear second-order cone programs
- Definite and Semidefinite Quadratic Forms
This page was built for publication: The rate of convergence of proximal method of multipliers for second-order cone optimization problems