Kurdyka-Łojasiewicz exponent via inf-projection
From MaRDI portal
Publication:2162122
DOI10.1007/s10208-021-09528-6zbMath1501.90047arXiv1902.03635OpenAlexW3182599367MaRDI QIDQ2162122
Guoyin Li, Peiran Yu, Ting Kei Pong
Publication date: 5 August 2022
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.03635
convergence rateKurdyka-Łojasiewicz inequalityfirst-order methodsinf-projectionKurdyka-Łojasiewicz exponent
Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)
Related Items
Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints, Quadratic growth conditions and uniqueness of optimal solution to Lasso, The equivalence of three types of error bounds for weakly and approximately convex functions, An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis, Tensor factorization via transformed tensor-tensor product for image alignment, Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems, Calculus rules of the generalized concave Kurdyka-Łojasiewicz property, Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems, Convergence Rate Analysis of a Dykstra-Type Projection Algorithm, Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints, Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems, Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nearly unbiased variable selection under minimax concave penalty
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- A note on alternating projections for ill-posed semidefinite feasibility problems
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- Convex analysis and nonlinear optimization. Theory and examples.
- Semidefinite representation of convex sets
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- A coordinate gradient descent method for nonsmooth separable minimization
- Characterization of the subdifferential of some matrix norms
- On gradients of functions definable in o-minimal structures
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Sensitivity analysis of generalized equations
- From error bounds to the complexity of first-order descent methods for convex functions
- A unified approach to error bounds for structured convex optimization problems
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- A proximal difference-of-convex algorithm with extrapolation
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Strong duality and minimal representations for cone optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- Lectures on Modern Convex Optimization
- Generalized Low Rank Models
- Enforcing Group Structure through the Group Fused Lasso
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Clarke Subgradients of Stratifiable Functions
- Implicit Functions and Solution Mappings
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Variational Analysis
- Error Bounds for Linear Matrix Inequalities
- Facial Reduction and Partial Polyhedrality
- Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions
- On Projection Algorithms for Solving Convex Feasibility Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Comments on «Wavelets in statistics: A review» by A. Antoniadis
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem
- Gauge Optimization and Duality
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Explicit bounds for the Łojasiewicz exponent in the gradient inequality for polynomials
- Convex Analysis
- Convex analysis and global optimization
- Mathematical Programs with Equilibrium Constraints
