A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization
type: Item
instance of: scholarly article
title: A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization
author: Chen Zhang
author: Pengjie Liu
author: Jinbao Jian
published in: Acta Mathematica Scientia. Series B. (English Edition)
publication date: 2022-10-21T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49M27
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7605432
zbMATH Keywords: large scale optimization
zbMATH Keywords: two-block smooth optimization
zbMATH Keywords: splitting method
zbMATH Keywords: feasible sequential quadratic optimization method
zbMATH Keywords: superlinear convergence
MaRDI profile type: Publication
full work available at URL: s10473-023-0101-z
OpenAlex ID: W4284961056
cites work: Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
cites work: A successive quadratic programming algorithm with global and superlinear convergence properties
cites work: Object-oriented software for quadratic programming
cites work: Q3995612
cites work: Fast alternating linearization methods for minimizing the sum of two convex functions
cites work: Fast Alternating Direction Optimization Methods
cites work: Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
cites work: A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
cites work: Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
cites work: On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
cites work: On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
cites work: Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
cites work: A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
cites work: Q4963652
cites work: Q5382420
cites work: A globally convergent QP-free algorithm for inequality constrained minimax optimization
cites work: A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
cites work: Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems
cites work: A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
cites work: A Nonlinear Alternating Direction Method
cites work: Global Convergence of Splitting Methods for Nonconvex Composite Optimization
cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators
cites work: Q3126807
cites work: Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
cites work: A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
cites work: Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
cites work: A quadratically-convergent algorithm for general nonlinear programming problems
cites work: Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
cites work: Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
cites work: An efficient feasible SQP algorithm for inequality constrained optimization
DOI: 10.1007/S10473-023-0101-Z
description: scientific article; zbMATH DE number 7605432