A distributed method hybridizing fully symmetric Peaceman–Rachford regularization with sequential quadratic programming for nonconvex-nonsmooth multi-block optimization
Authors:
- 20 August 2026
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 96 (1) , 39-89
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (12171106)
- Guangxi Science and Technology Program (AD23023001)
- Guangxi Science and Technology Program (12401403)
- Natural Science Foundation of Guangxi Province (2025GXNSFAA069772)
This publication has 39 references indexed in Scilit:
- An adaptive proximal ADMM for nonconvex linearly constrained composite programsMathematical Programming, 2026
- A Bregman-style Partially Symmetric Alternating Direction Method of Multipliers for Nonconvex Multi-block OptimizationActa Mathematicae Applicatae Sinica, English Series, 2023
- A Superlinearly Convergent Splitting Feasible Sequential Quadratic Optimization Method for Two-Block Large-Scale Smooth OptimizationActa Mathematica Scientia, 2022
- Banach Spaces of Lipschitz Functions2019
- On non-ergodic convergence rate of Douglas–Rachford alternating direction method of multipliersNumerische Mathematik, 2014
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergentMathematical Programming, 2014
- Proximal alternating linearized minimization for nonconvex and nonsmooth problemsMathematical Programming, 2013
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalitiesComputational Optimization and Applications, 2007
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraintCommunications on Pure and Applied Mathematics, 2004
- Test Examples for Nonlinear Programming Codes1981