Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

DOI10.1287/moor.1100.0449zbMath1214.65036arXiv0801.1780OpenAlexW2129732816MaRDI QIDQ3169101

Jérôme Bolte, Patrick Redont, Hedy Attouch, Antoine Soubeyran

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0801.1780

zbMATH Keywords

regularizationcritical pointnonconvex optimizationconvergence rateGauss-Seidel methodgradient systemsKurdyka-Łojasiewicz inequalityo-minimal structuressparse reconstructionproximal algorithmstame optimizationalternating minimization algorithmsfinite convergence timealternating projections algorithms

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Decomposition methods (49M27)

Related Items (only showing first 100 items - show all)

Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms ⋮ Block delayed Majorize-Minimize subspace algorithm for large scale image restoration ^* ⋮ Convergence guarantees for a class of non-convex and non-smooth optimization problems ⋮ A combined dictionary learning and TV model for image restoration with convergence analysis ⋮ Solving sparse principal component analysis with global support ⋮ Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations ⋮ Simultaneous recovery of attenuation and source density in SPECT ⋮ A converged deep graph semi-NMF algorithm for learning data representation ⋮ An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis ⋮ Error bounds, facial residual functions and applications to the exponential cone ⋮ Robust sensing of low-rank matrices with non-orthogonal sparse decomposition ⋮ A tensor optimization algorithm for computing Lagrangians of hypergraphs ⋮ Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound ⋮ Global convergence of the gradient method for functions definable in o-minimal structures ⋮ Lyapunov stability of the subgradient method with constant step size ⋮ Nonconvex optimization with inertial proximal stochastic variance reduction gradient ⋮ An Unrolled Implicit Regularization Network for Joint Image and Sensitivity Estimation in Parallel MR Imaging with Convergence Guarantee ⋮ A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors ⋮ Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems ⋮ Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions ⋮ The convergence properties of infeasible inexact proximal alternating linearized minimization ⋮ Conditions for linear convergence of the gradient method for non-convex optimization ⋮ Doubly iteratively reweighted algorithm for constrained compressed sensing models ⋮ Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems ⋮ A Bregman-style partially symmetric alternating direction method of multipliers for nonconvex multi-block optimization ⋮ A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems ⋮ A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds ⋮ A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model ⋮ Joint Reconstruction-Segmentation on Graphs ⋮ A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems ⋮ Topology optimization for inverse magnetostatics as sparse regression: application to electromagnetic coils for stellarators ⋮ Tensor factorization via transformed tensor-tensor product for image alignment ⋮ An \(l_0\)-norm based color image deblurring model under mixed random-valued impulse and Gaussian noise ⋮ Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm ⋮ An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems ⋮ Nested alternating minimization with FISTA for non-convex and non-smooth optimization problems ⋮ A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems ⋮ First order inertial optimization algorithms with threshold effects associated with dry friction ⋮ Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization ⋮ Image cartoon-texture decomposition by a generalized non-convex low-rank minimization method ⋮ Quaternion-based color image completion via logarithmic approximation ⋮ Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems ⋮ Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis ⋮ On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization ⋮ Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality ⋮ A forward-backward algorithm with different inertial terms for structured non-convex minimization problems ⋮ An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems ⋮ Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification ⋮ An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant ⋮ Calculus rules of the generalized concave Kurdyka-Łojasiewicz property ⋮ Fast optimization via inertial dynamics with closed-loop damping ⋮ Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems ⋮ Scaled proximal gradient methods for sparse optimization problems ⋮ MF-OMO: An Optimization Formulation of Mean-Field Games ⋮ A Fast Minimization Algorithm for the Euler Elastica Model Based on a Bilinear Decomposition ⋮ Hyperspectral super-resolution via low rank tensor triple decomposition ⋮ Reexamining low rank matrix factorization for trace norm regularization ⋮ An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration ⋮ An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost ⋮ Unnamed Item ⋮ Alternating Proximal Regularized Dictionary Learning ⋮ A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems ⋮ A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal ⋮ An introduction to continuous optimization for imaging ⋮ Proximal Distance Algorithms: Theory and Examples ⋮ Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold ⋮ Sharpness, Restart, and Acceleration ⋮ ADMM for multiaffine constrained optimization ⋮ A second-order dynamical approach with variable damping to nonconvex smooth minimization ⋮ A self-adaptive regularized alternating least squares method for tensor decomposition problems ⋮ On Algorithms for Difference of Monotone Operators ⋮ On Algorithms for Difference of Monotone Operators ⋮ The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions ⋮ Modern regularization methods for inverse problems ⋮ A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems ⋮ Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems ⋮ A Simple Framework for Stability Analysis of State-Dependent Networks of Heterogeneous Agents ⋮ An Inertial Newton Algorithm for Deep Learning ⋮ Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers ⋮ Non-Lipschitz Models for Image Restoration with Impulse Noise Removal ⋮ Unnamed Item ⋮ Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging ⋮ The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings ⋮ A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima ⋮ Nonlocal robust tensor recovery with nonconvex regularization ^* ⋮ Approximate first-order primal-dual algorithms for saddle point problems ⋮ Triple Decomposition and Tensor Recovery of Third Order Tensors ⋮ Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences ⋮ Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework ⋮ Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction ⋮ Variational Rician Noise Removal via Splitting on Spheres ⋮ Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms ⋮ Tensor Manifold with Tucker Rank Constraints ⋮ On Optimality Conditions for Nonlinear Conic Programming ⋮ Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction ⋮ Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity ⋮ The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property ⋮ Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem ⋮ Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming ⋮ Convergence rate analysis for the higher order power method in best rank one approximations of tensors

This page was built for publication: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality