A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
From MaRDI portal
Publication:4602329
DOI10.1142/S0217595917500300zbMath1383.90028OpenAlexW2769032176MaRDI QIDQ4602329
Deren Han, David Z. W. Wang, Min Li, Zhongming Wu
Publication date: 10 January 2018
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595917500300
nonconvex optimizationlinear constraintssymmetricalternating direction method of multipliersKurdyka-Łojasiewicz property
Related Items
An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization ⋮ Convergence of linear Bregman ADMM for nonconvex and nonsmooth problems with nonseparable structure ⋮ Randomized algorithms for orthogonal nonnegative matrix factorization ⋮ A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems ⋮ Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization ⋮ Unnamed Item ⋮ An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems ⋮ Unnamed Item ⋮ The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems ⋮ Sparsity reconstruction using nonconvex TGpV-shearlet regularization and constrained projection ⋮ Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems ⋮ Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems ⋮ Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems ⋮ Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms ⋮ An extended proximal ADMM algorithm for three-block nonconvex optimization problems ⋮ A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems ⋮ Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
Uses Software
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On gradients of functions definable in o-minimal structures
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Optimization with Sparsity-Inducing Penalties
- A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Restricted isometry properties and nonconvex compressive sensing
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Unnamed Item
- Unnamed Item
