Convergence of three-block ADMM for weakly convex optimization problems
From MaRDI portal
Cites work
- A convergent 3-block semi-proximal ADMM for convex minimization problems with one strongly convex block
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization
- A note on the alternating direction method of multipliers
- A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions
- A sequential updating scheme of the Lagrange multiplier for separable convex programming
- A Singular Value Thresholding Algorithm for Matrix Completion
- A splitting method for separable convex programming
- A survey of hidden convex optimization
- A survey on some recent developments of alternating direction method of multipliers
- A three-operator splitting scheme and its optimization applications
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- Alternating direction method of multipliers for nonconvex fused regression problems
- Alternating direction method with Gaussian back substitution for separable convex programming
- An ADM-based splitting method for separable convex programming
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- An order-\(p\) tensor factorization with applications in imaging
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Convergence analysis of Douglas-Rachford splitting method for ``strongly + weakly convex programming
- Convergence of ADMM for multi-block nonconvex separable optimization models
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Convex analysis and monotone operator theory in Hilbert spaces
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms
- Efficiency of minimizing compositions of convex functions and smooth maps
- Factorization strategies for third-order tensors
- First-order convergence theory for weakly-convex-weakly-concave min-max problems
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global convergence of splitting methods for nonconvex composite optimization
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- Manifold elastic net: a unified framework for sparse dimension reduction
- Nearly unbiased variable selection under minimax concave penalty
- Nonconvex optimization for robust tensor completion from grossly sparse observations
- On alternating direction methods of multipliers: a historical perspective
- On the convergence analysis of the alternating direction method of multipliers with three blocks
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty
- On the global and linear convergence of the generalized alternating direction method of multipliers
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- On the linear convergence of the alternating direction method of multipliers
- On the sublinear convergence rate of multi-block ADMM
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Robust principal component analysis?
- Robust tensor completion using transformed tensor singular value decomposition
- Strongly convex programming for exact matrix completion and robust principal component analysis
- Subgradient methods for sharp weakly convex functions
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
- Understanding the convergence of the alternating direction method of multipliers: theoretical and computational perspectives
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variable smoothing for weakly convex composite functions
Cited in
(2)
This page was built for publication: Convergence of three-block ADMM for weakly convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7013082)
