The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
From MaRDI portal
Publication:5119852
DOI10.1287/moor.2019.1008zbMath1480.90198arXiv1801.01994OpenAlexW3011526999MaRDI QIDQ5119852
Radu Ioan Boţ, Dang-Khoa Nguyen
Publication date: 1 September 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.01994
convergence analysisnonconvex optimizationalternating direction method of multipliersproximal splitting algorithmKL-property
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Monotone operators and generalizations (47H05)
Related Items
A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints, Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems, An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization, Inertial alternating direction method of multipliers for non-convex non-smooth optimization, A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem, Proximal linearization methods for Schatten \(p\)-quasi-norm minimization, A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem, A new Lagrangian-based first-order method for nonconvex constrained optimization, Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality, A forward-backward algorithm with different inertial terms for structured non-convex minimization problems, A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization, An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems, ADMM-Type Methods for Generalized Nash Equilibrium Problems in Hilbert Spaces, Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization, Local linear convergence of an ADMM-type splitting framework for equality constrained optimization, The alternating direction method of multipliers for finding the distance between ellipsoids, Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization, A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization, An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications, A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization, QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs, Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization, A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- On the linear convergence of the alternating direction method of multipliers
- A class of linearized proximal alternating direction methods
- Variable metric quasi-Fejér monotonicity
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Computing proximal points of nonconvex functions
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- On gradients of functions definable in o-minimal structures
- Global convergence of ADMM in nonconvex nonsmooth optimization
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- ADMM for monotone operators: convergence analysis and rates
- An inertial alternating direction method of multipliers
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- 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
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Clarke Subgradients of Stratifiable Functions
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Variational Analysis
- First-Order Methods in Optimization
- Variational Analysis and Generalized Differentiation I
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
- An Accelerated Linearized Alternating Direction Method of Multipliers
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- Alternating Projections on Manifolds
- A Primal-Dual Splitting Algorithm for Finding Zeros of Sums of Maximal Monotone Operators
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Signal Recovery by Proximal Forward-Backward Splitting
