Pages that link to "Item:Q1785009"

The following pages link to Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods (Q1785009):

Displaying 50 items.

• Convergence rate analysis for the higher order power method in best rank one approximations of tensors (Q1616037) (← links)
• Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355) (← links)
• From error bounds to the complexity of first-order descent methods for convex functions (Q1675251) (← links)
• A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
• A new nonconvex approach to low-rank matrix completion with application to image inpainting (Q1710943) (← links)
• A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property (Q1739040) (← links)
• A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
• On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems (Q2010091) (← links)
• Kurdyka-Łojasiewicz property of zero-norm composite functions (Q2026719) (← links)
• Variable smoothing for weakly convex composite functions (Q2031930) (← links)
• On the linear convergence of forward-backward splitting method. I: Convergence analysis (Q2031953) (← links)
• Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method (Q2046546) (← links)
• A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging (Q2051043) (← links)
• An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems (Q2067857) (← links)
• Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
• Inertial proximal incremental aggregated gradient method with linear convergence guarantees (Q2084299) (← links)
• On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint (Q2089778) (← links)
• Nondegeneracy of eigenvectors and singular vector tuples of tensors (Q2106839) (← links)
• Avoiding bad steps in Frank-Wolfe variants (Q2111475) (← links)
• Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis (Q2116020) (← links)
• Restarting Frank-Wolfe: faster rates under Hölderian error bounds (Q2116603) (← links)
• Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems (Q2141356) (← links)
• Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints (Q2148118) (← links)
• Global convergence of model function based Bregman proximal minimization algorithms (Q2154449) (← links)
• Kurdyka-Łojasiewicz exponent via inf-projection (Q2162122) (← links)
• A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection (Q2200085) (← links)
• A proximal interior point algorithm with applications to image processing (Q2203368) (← links)
• Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property (Q2231349) (← links)
• Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization (Q2235149) (← links)
• Local linear convergence of an ADMM-type splitting framework for equality constrained optimization (Q2240104) (← links)
• New analysis of linear convergence of gradient-type methods via unifying error bound conditions (Q2297652) (← links)
• The modified second APG method for DC optimization problems (Q2311112) (← links)
• Convergence rates of forward-Douglas-Rachford splitting method (Q2317846) (← links)
• Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods (Q2330648) (← links)
• Further properties of the forward-backward envelope with applications to difference-of-convex programming (Q2364125) (← links)
• A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
• A forward-backward dynamical approach for nonsmooth problems with block structure coupled by a smooth function (Q2662659) (← 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)
• Proximal linearization methods for Schatten \(p\)-quasi-norm minimization (Q2678970) (← links)
• A globally convergent proximal Newton-type method in nonsmooth convex optimization (Q2687066) (← links)
• Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry (Q2687067) (← 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)
• General Hölder smooth convergence rates follow from specialized rates assuming growth bounds (Q2696991) (← links)
• Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002) (← links)
• Local Minimizers of Semi-Algebraic Functions from the Viewpoint of Tangencies (Q3300766) (← links)
• On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization (Q4602339) (← links)
• On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition (Q4634142) (← links)
• Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization (Q4997175) (← links)