Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization
From MaRDI portal
Publication:2089885
DOI10.1007/s10898-022-01174-8zbMath1505.90096OpenAlexW4281569539MaRDI QIDQ2089885
Publication date: 24 October 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01174-8
convergenceconvergence rateKurdyka-Łojasiewicz inequalityalternating direction method of multiplier (ADMM)nonconvex and nonsmooth optimizationvariable metric proximal terms
Related Items
Uses Software
Cites Work
- 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
- Nearly unbiased variable selection under minimax concave penalty
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- On the linear convergence of the alternating direction method of multipliers
- A three-operator splitting scheme and its optimization applications
- On the sublinear convergence rate of multi-block ADMM
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Global convergence of unmodified 3-block ADMM for a class of convex minimization problems
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Generalized symmetric ADMM for separable convex optimization
- A note on the alternating direction method of multipliers
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Bregman operator splitting with variable stepsize for total variation image reconstruction
- Efficient alternating minimization methods for variational edge-weighted colorization models
- On the convergence analysis of the alternating direction method of multipliers with three blocks
- Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the global and linear convergence of the generalized alternating direction method of multipliers
- An alternating direction approximate Newton algorithm for ill-conditioned inverse problems with application to parallel MRI
- An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm
- A sequential updating scheme of the Lagrange multiplier for separable convex programming
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Fast Multiple-Splitting Algorithms for Convex Optimization
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Alternating direction methods for classical and ptychographic phase retrieval
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A Fast Relaxed Normal Two Split Method and an Effective Weighted TV Approach for Euler's Elastica Image Inpainting
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Alternating Direction Method of Multiplier for Euler’s Elastica-Based Denoising
- On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Clarke Subgradients of Stratifiable Functions
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Variational Analysis
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
- Comments on «Wavelets in statistics: A review» by A. Antoniadis
- Fast Alternating Direction Optimization Methods
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers
- Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
- Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
