Global convergence of splitting methods for nonconvex composite optimization
From MaRDI portal
Abstract: We consider the problem of minimizing the sum of a smooth function with a bounded Hessian, and a nonsmooth function. We assume that the latter function is a composition of a proper closed function and a surjective linear map , with the proximal mappings of , , simple to compute. This problem is nonconvex in general and encompasses many important applications in engineering and machine learning. In this paper, we examined two types of splitting methods for solving this nonconvex optimization problem: alternating direction method of multipliers and proximal gradient algorithm. For the direct adaptation of the alternating direction method of multipliers, we show that, if the penalty parameter is chosen sufficiently large and the sequence generated has a cluster point, then it gives a stationary point of the nonconvex problem. We also establish convergence of the whole sequence under an additional assumption that the functions and are semi-algebraic. Furthermore, we give simple sufficient conditions to guarantee boundedness of the sequence generated. These conditions can be satisfied for a wide range of applications including the least squares problem with the regularization. Finally, when is the identity so that the proximal gradient algorithm can be efficiently applied, we show that any cluster point is stationary under a slightly more flexible constant step-size rule than what is known in the literature for a nonconvex .
Recommendations
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
- Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization
- The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
- The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
Cites work
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A generalized proximal point algorithm for certain non-convex minimization problems
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Alternating direction method for image inpainting in wavelet domains
- An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Clarke Subgradients of Stratifiable Functions
- Computing proximal points of nonconvex functions
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Decoding by Linear Programming
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Eigenvalues of tridiagonal pseudo-Toeplitz matrices
- Exact matrix completion via convex optimization
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 3894797 (Why is no real title available?)
- Iterative thresholding for sparse approximations
- Matrix completion via an alternating direction method
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the local convergence of the Douglas-Rachford algorithm
- Optimization models
- Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Variational Analysis
Cited in
(only showing first 100 items - show all)- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- Global convergence of unmodified 3-block ADMM for a class of convex minimization problems
- Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm
- Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms
- A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem
- Peaceman-Rachford splitting for a class of nonconvex optimization problems
- Convergence of ADMM for multi-block nonconvex separable optimization models
- Revisiting the redistancing problem using the Hopf-Lax formula
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
- On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1]\)
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Fast L1-L2 minimization via a proximal operator
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Priors with coupled first and second order differences for manifold-valued image processing
- Whiteness constraints in a unified variational framework for image restoration
- A general truncated regularization framework for contrast-preserving variational signal and image restoration: motivation and implementation
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
- Fast algorithms for robust principal component analysis with an upper bound on the rank
- Numerical analysis of constrained total variation flows
- An extended proximal ADMM algorithm for three-block nonconvex optimization problems
- An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems
- MAP inference via _2-sphere linear program reformulation
- An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing
- A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization
- A regularized alternating direction method of multipliers for a class of nonconvex problems
- An ADMM-based SQP method for separably smooth nonconvex optimization
- A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization
- Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
- An adaptive alternating direction method of multipliers
- Proximal ADMM for nonconvex and nonsmooth optimization
- Efficient low-rank regularization-based algorithms combining advanced techniques for solving tensor completion problems with application to color image recovering
- A survey on some recent developments of alternating direction method of multipliers
- Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm
- A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints
- Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms
- An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization
- Inertial alternating direction method of multipliers for non-convex non-smooth optimization
- Dynamic behavior analysis via structured rank minimization
- A new numerical scheme for discrete constrained total variation flows and its convergence
- Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery
- Bregman reweighted alternating minimization and its application to image deblurring
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
- An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems
- Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property
- Local linear convergence of an ADMM-type splitting framework for equality constrained optimization
- Sparsity reconstruction using nonconvex TGpV-shearlet regularization and constrained projection
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
- On a monotone scheme for nonconvex nonsmooth optimization with applications to fracture mechanics
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
- On polarization-based schemes for the FFT-based computational homogenization of inelastic materials
- Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- Convergence of linear Bregman ADMM for nonconvex and nonsmooth problems with nonseparable structure
- Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
- Proximal linearization methods for Schatten p-quasi-norm minimization
- A two-level distributed algorithm for nonconvex constrained optimization
- Efficient learning with a family of nonconvex regularizers by redistributing nonconvexity
- Tight Global Linear Convergence Rate Bounds for Operator Splitting Methods
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano
- A general system for heuristic minimization of convex functions over non-convex sets
- Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Sequence convergence of inexact nonconvex and nonsmooth algorithms with more realistic assumptions
- An alternating direction method of multipliers for the eigenvalue complementarity problem
- On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms
- A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization
- Longitudinal clustering for heterogeneous binary data
- A three-operator splitting algorithm for nonconvex sparsity regularization
- Local saddles of relaxed averaged alternating reflections algorithms on phase retrieval
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
- An inertial proximal alternating direction method of multipliers for nonconvex optimization
- A general non-Lipschitz infimal convolution regularized model: Lower bound theory and algorithm
- An Unbiased Approach to Low Rank Recovery
- Minimization of L₁ over L₂ for sparse signal recovery with convergence guarantee
- Minimizing \(L_1\) over \(L_2\) norms on the gradient
- Nonconvex flexible sparsity regularization: theory and monotone numerical schemes
- The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
- A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization
- A Scale-Invariant Approach for Sparse Signal Recovery
- A simple effective heuristic for embedded mixed-integer quadratic programming
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- ADMM for multiaffine constrained optimization
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- Modern regularization methods for inverse problems
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- Low-Complexity Method for Hybrid MPC with Local Guarantees
- The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
- Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background/foreground extraction
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
- Multi-channel Potts-based reconstruction for multi-spectral computed tomography
This page was built for publication: Global convergence of splitting methods for nonconvex composite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457189)
