An ADMM-based SQP method for separably smooth nonconvex optimization
From MaRDI portal
Publication:2069362
Recommendations
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
- scientific article; zbMATH DE number 7071986
- Convergence of linear Bregman ADMM for nonconvex and nonsmooth problems with nonseparable structure
- An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications
- Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
Cites work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A quadratically-convergent algorithm for general nonlinear programming problems
- A strictly contractive Peaceman-Rachford splitting method for convex programming
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
- An efficient feasible SQP algorithm for inequality constrained optimization
- Clarke Subgradients of Stratifiable Functions
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Fast alternating direction optimization methods
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- Global convergence of splitting methods for nonconvex composite optimization
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 7071986 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
Cited in
(10)- ADMM for the SDP relaxation of the QAP
- A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
- Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure
- scientific article; zbMATH DE number 7599681 (Why is no real title available?)
- scientific article; zbMATH DE number 7071986 (Why is no real title available?)
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
- A linear approximate Bregman-type Peaceman-Rachford splitting method for nonconvex nonseparable optimization
- A partially feasible Jacobi-type distributed SQO method for two-block general linearly constrained smooth optimization
- Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems
This page was built for publication: An ADMM-based SQP method for separably smooth nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2069362)
