Pages that link to "Item:Q2957980"

The following pages link to Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems (Q2957980):

Displaying 48 items.

• A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions (Q1630270) (← links)
• A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem (Q1729942) (← 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)
• The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems (Q1983743) (← links)
• Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems (Q2022292) (← links)
• Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems (Q2022322) (← links)
• Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems (Q2026713) (← links)
• Kurdyka-Łojasiewicz property of zero-norm composite functions (Q2026719) (← links)
• Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions (Q2028458) (← links)
• An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing (Q2059822) (← links)
• An improved linear convergence of FISTA for the LASSO problem with application to CT image reconstruction (Q2060059) (← links)
• An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems (Q2067857) (← links)
• Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems (Q2082554) (← links)
• Inertial proximal incremental aggregated gradient method with linear convergence guarantees (Q2084299) (← links)
• Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems (Q2105897) (← links)
• Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis (Q2116020) (← links)
• Convergence results of a new monotone inertial forward-backward splitting algorithm under the local Hölder error bound condition (Q2128612) (← links)
• On compositions of special cases of Lipschitz continuous operators (Q2138459) (← links)
• Convergence of inexact quasisubgradient methods with extrapolation (Q2139278) (← links)
• A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems (Q2143100) (← links)
• A double extrapolation primal-dual algorithm for saddle point problems (Q2211739) (← links)
• Nonconvex proximal incremental aggregated gradient method with linear convergence (Q2275279) (← links)
• Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem (Q2307753) (← links)
• A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications (Q2414911) (← links)
• A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
• General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems (Q2419543) (← links)
• Non-smooth non-convex Bregman minimization: unification and new algorithms (Q2420780) (← links)
• A proximal algorithm with backtracked extrapolation for a class of structured fractional programming (Q2667040) (← links)
• Proximal gradient methods for general smooth graph total variation model in unsupervised learning (Q2674267) (← links)
• A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem (Q2696923) (← links)
• Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002) (← links)
• An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model ^* (Q5019920) (← links)
• Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization (Q5037570) (← links)
• The chain rule for VU-decompositions of nonsmooth functions (Q5110185) (← links)
• Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems (Q5865360) (← links)
• Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection (Q5882243) (← links)
• Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound (Q6051308) (← links)
• Convergence of the Momentum Method for Semialgebraic Functions with Locally Lipschitz Gradients (Q6071885) (← links)
• Double inertial parameters forward-backward splitting method: Applications to compressed sensing, image processing, and SCAD penalty problems (Q6085639) (← links)
• Sparse and risk diversification portfolio selection (Q6097487) (← links)
• Inertial projected gradient method for large-scale topology optimization (Q6104281) (← links)
• Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem (Q6111359) (← links)
• A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems (Q6145571) (← links)
• A non-convex piecewise quadratic approximation of \(\ell_0\) regularization: theory and accelerated algorithm (Q6162509) (← links)
• An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems (Q6164017) (← links)
• Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems (Q6182324) (← links)
• Joint sparse optimization: lower-order regularization method and application in cell fate conversion (Q6581202) (← links)
• A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems (Q6593828) (← links)