Pages that link to "Item:Q2968179"

The following pages link to Activity Identification and Local Linear Convergence of Forward--Backward-type Methods (Q2968179):

Displaying 33 items.

• Nonsmoothness in machine learning: specific structure, proximal identification, and applications (Q829492) (← links)
• From error bounds to the complexity of first-order descent methods for convex functions (Q1675251) (← links)
• Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization (Q1730794) (← links)
• Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions (Q2013141) (← links)
• Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions (Q2020604) (← links)
• On the interplay between acceleration and identification for the proximal gradient algorithm (Q2023654) (← links)
• On the linear convergence of forward-backward splitting method. I: Convergence analysis (Q2031953) (← links)
• Functional penalised basis pursuit on spheres (Q2036409) (← links)
• A projected extrapolated gradient method with larger step size for monotone variational inequalities (Q2046702) (← links)
• An explicit algorithm for solving monotone variational inequalities (Q2238840) (← links)
• Faster subgradient methods for functions with Hölderian growth (Q2297653) (← links)
• An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization (Q2307750) (← links)
• ``Active-set complexity'' of proximal gradient: how long does it take to find the sparsity pattern? (Q2311100) (← links)
• Convergence rates of forward-Douglas-Rachford splitting method (Q2317846) (← links)
• Local convergence properties of Douglas-Rachford and alternating direction method of multipliers (Q2397468) (← links)
• An active set Newton-CG method for \(\ell_1\) optimization (Q2659721) (← links)
• On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals (Q2670979) (← links)
• Quadratic growth conditions and uniqueness of optimal solution to Lasso (Q2671439) (← links)
• Convergence rates of the heavy-ball method under the Łojasiewicz property (Q2687044) (← links)
• Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry (Q2687067) (← links)
• Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation (Q3384130) (← links)
• Active‐Set Newton Methods and Partial Smoothness (Q5000651) (← links)
• Proximal Gradient Methods with Adaptive Subspace Sampling (Q5026438) (← links)
• Thresholding gradient methods in Hilbert spaces: support identification and linear convergence (Q5109200) (← links)
• The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy (Q5210421) (← links)
• A Trust-region Method for Nonsmooth Nonconvex Optimization (Q5881403) (← links)
• ``FISTA'' in Banach spaces with adaptive discretisations (Q6043131) (← links)
• Newton acceleration on manifolds identified by proximal gradient methods (Q6044974) (← links)
• Fast gradient method for low-rank matrix estimation (Q6111368) (← links)
• Nonmonotone globalization for Anderson acceleration via adaptive regularization (Q6159247) (← links)
• A forward-backward algorithm with different inertial terms for structured non-convex minimization problems (Q6163956) (← links)
• Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification (Q6165598) (← links)
• Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)