Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
From MaRDI portal
(Redirected from Publication:6071886)
Abstract: We consider a composite optimization problem where the sum of a continuously differentiable and a merely lower semicontinuous function has to be minimized. The proximal gradient algorithm is the classical method for solving such a problem numerically. The corresponding global convergence and local rate-of-convergence theory typically assumes, besides some technical conditions, that the smooth function has a globally Lipschitz continuous gradient and that the objective function satisfies the Kurdyka-{L}ojasiewicz property. Though this global Lipschitz assumption is satisfied in several applications where the objective function is, e.g., quadratic, this requirement is very restrictive in the non-quadratic case. Some recent contributions therefore try to overcome this global Lipschitz condition by replacing it with a local one, but, to the best of our knowledge, they still require some extra condition in order to obtain the desired global and rate-of-convergence results. The aim of this paper is to show that the local Lipschitz assumption together with the Kurdyka-{L}ojasiewicz property is sufficient to recover these convergence results.
Recommendations
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- The gradient projection algorithm for smooth sets and functions in nonconvex case
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption
Cites work
- A concave optimization-based approach for sparse portfolio selection
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints
- A fast dual proximal gradient algorithm for convex minimization and applications
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A generalized proximal point algorithm for certain non-convex minimization problems
- A new augmented Lagrangian method for MPCCs -- theoretical and numerical comparison with existing augmented Lagrangian methods
- Accelerating the DC algorithm for smooth functions
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- Clarke Subgradients of Stratifiable Functions
- Constrained composite optimization and augmented Lagrangian methods
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- First-order methods in optimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- scientific article; zbMATH DE number 3595777 (Why is no real title available?)
- scientific article; zbMATH DE number 3381034 (Why is no real title available?)
- iPiano: inertial proximal algorithm for nonconvex optimization
- Joint Power and Admission Control: Non-Convex <formula formulatype="inline"><tex Notation="TeX">$L_{q}$</tex></formula> Approximation and An Effective Polynomial Time Deflation Approach
- Linearly constrained non-Lipschitz optimization for image restoration
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- Monotone Operators and the Proximal Point Algorithm
- On $l_q$ Optimization and Matrix Completion
- On gradients of functions definable in o-minimal structures
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC
- Sparse Reconstruction by Separable Approximation
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- The value function approach to convergence analysis in composite optimization
- Variational Analysis
- Variational analysis and applications
Cited in
(11)- Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters
- Local Conditions for Global Convergence of Gradient Flows and Proximal Point Sequences in Metric Spaces
- Proximal gradient methods beyond monotony
- A Levenberg-Marquardt method for nonsmooth regularized least squares
- An inexact regularized proximal Newton method without line search
- Extrapolated hard thresholding algorithms with finite length for composite _0 penalized problems
- Convergence of nonmonotone proximal gradient methods under the Kurdyka-Łojasiewicz property without a global Lipschitz assumption
- Projected gradient descent accumulates at Bouligand stationary points
- An accelerated mirror descent algorithm for constrained nonconvex problems
- Robust sparse phase retrieval: statistical guarantee, optimality theory and convergent algorithm
- A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
This page was built for publication: Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6071886)
