Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems
DOI10.1007/S10957-020-01697-8zbMATH Open1461.65160OpenAlexW3037596826MaRDI QIDQ779870FDOQ779870
Authors: Jinbao Jian, Chen Zhang, Jiang-Hua Yin, Linfeng Yang, Guodong Ma 
Publication date: 14 July 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01697-8
Recommendations
- 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
- scientific article; zbMATH DE number 7071986
- An inexact sequential quadratic optimization algorithm for nonlinear optimization
- An ADMM-based SQP method for separably smooth nonconvex optimization
splitting algorithmelectric power systemslinear equality and box constraintssequential quadratic optimizationtwo-block nonconvex optimization
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)
Cites Work
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Fast alternating direction optimization methods
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- Title not available (Why is that?)
- A strictly contractive Peaceman-Rachford splitting method for convex programming
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- Convergence study on the symmetric version of ADMM with larger step sizes
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- An efficient feasible SQP algorithm for inequality constrained optimization
- A successive quadratic programming algorithm with global and superlinear convergence properties
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global convergence of splitting methods for nonconvex composite optimization
- Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces
Cited In (12)
- A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization
- A Bregman-style improved ADMM and its linearized version in the nonconvex setting: convergence and rate analyses
- Splitting augmented Lagrangian-type algorithms with partial quadratic approximation to solve sparse signal recovery problems
- Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems
- Parallel optimal power flow algorithm based on auxiliary problem principle and sequential quadratic programming method
- Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure
- A class of accelerated GADMM-based method for multi-block nonconvex optimization problems
- A partially feasible Jacobi-type distributed SQO method for two-block general linearly constrained smooth optimization
- Two linear proximal Peaceman-Rachford splitting algorithms for nonconvex and nonsmooth nonseparable optimization
- Dual descent augmented Lagrangian method and alternating direction method of multipliers
- 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
Uses Software
This page was built for publication: Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779870)
