Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
From MaRDI portal
Publication:2026713
DOI10.1007/s10957-020-01782-yzbMath1468.90093OpenAlexW3119713202MaRDI QIDQ2026713
Zehui Jia, Deren Han, Xue Gao, Xing-Ju Cai
Publication date: 20 May 2021
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-01782-y
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items
A survey on some recent developments of alternating direction method of multipliers ⋮ General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems ⋮ A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems ⋮ An optimization method to solve a fully intuitionistic fuzzy non-linear separable programming problem ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Sparse solutions to random standard quadratic optimization problems
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Error bounds and convergence analysis of feasible descent methods: A general approach
- A test for copositive matrices
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Quadratic-programming criteria for copositive matrices
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Continuous Characterizations of the Maximum Clique Problem
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs