A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization

DOI10.3934/JIMO.2023042zbMath1524.65220OpenAlexW4366316887MaRDI QIDQ6102892

Donglei Cui, Jianghua Yin, Guodong Ma, Jin-Bao Jian

Publication date: 23 June 2023

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2023042

zbMATH Keywords

splitting algorithmdouble-step-lengthnonlinearly constrained nonconvex optimizationsequential quadratic optimization algorithmsymmetric splitting method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems
• A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
• A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
• Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
• A new inexact alternating directions method for monotone variational inequalities
• Global convergence of ADMM in nonconvex nonsmooth optimization
• The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems
• A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure
• A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem
• A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
• Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization
• A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
• A successive quadratic programming algorithm with global and superlinear convergence properties
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization
• An inertial proximal alternating direction method of multipliers for nonconvex optimization
• A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
• An SQP Method for Equality Constrained Optimization on Hilbert Manifolds
• A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization
• Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
• A quadratically-convergent algorithm for general nonlinear programming problems

This page was built for publication: A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization