Pages that link to "Item:Q2162122"

The following pages link to Kurdyka-Łojasiewicz exponent via inf-projection (Q2162122):

Displaying 19 items.

• Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints (Q2148118) (← links)
• Quadratic growth conditions and uniqueness of optimal solution to Lasso (Q2671439) (← links)
• The equivalence of three types of error bounds for weakly and approximately convex functions (Q2671442) (← links)
• Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems (Q2688921) (← links)
• Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) (← links)
• Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems (Q5010048) (← links)
• Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (Q5869813) (← links)
• An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis (Q6043137) (← links)
• Tensor factorization via transformed tensor-tensor product for image alignment (Q6119848) (← links)
• Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems (Q6155872) (← links)
• Calculus rules of the generalized concave Kurdyka-Łojasiewicz property (Q6167075) (← links)
• Convergence Rate Analysis of a Dykstra-Type Projection Algorithm (Q6202756) (← links)
• Coordinate descent methods beyond smoothness and separability (Q6498410) (← links)
• The level-set subdifferential error bound via Moreau envelopes (Q6561484) (← links)
• A novel nonconvex relaxation approach to low-rank matrix completion of inexact observed data (Q6573016) (← links)
• Non-Lipschitz variational models and their iteratively reweighted least squares algorithms for image denoising on surfaces (Q6587643) (← links)
• Sparse additive function decompositions facing basis transforms (Q6620138) (← links)
• A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping (Q6639509) (← links)
• A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging (Q6639517) (← links)