Activity Identification and Local Linear Convergence of Forward--Backward-type Methods

From MaRDI portal
Publication:2968179

DOI10.1137/16M106340XzbMath1357.49064arXiv1503.03703OpenAlexW2964094444MaRDI QIDQ2968179

Jalal Fadili, Gabriel Peyré, Jingwei Liang

Publication date: 10 March 2017

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.03703



Related Items

A Trust-region Method for Nonsmooth Nonconvex Optimization, Nonsmoothness in machine learning: specific structure, proximal identification, and applications, Sensitivity Analysis for Mirror-Stratifiable Convex Functions, Improving “Fast Iterative Shrinkage-Thresholding Algorithm”: Faster, Smarter, and Greedier, Local convergence properties of Douglas-Rachford and alternating direction method of multipliers, Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search, An active set Newton-CG method for \(\ell_1\) optimization, From error bounds to the complexity of first-order descent methods for convex functions, On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals, Quadratic growth conditions and uniqueness of optimal solution to Lasso, ``FISTA in Banach spaces with adaptive discretisations, Newton acceleration on manifolds identified by proximal gradient methods, Fast gradient method for low-rank matrix estimation, Thresholding gradient methods in Hilbert spaces: support identification and linear convergence, Screening Rules and its Complexity for Active Set Identification, Nonmonotone globalization for Anderson acceleration via adaptive regularization, Convergence rates of the heavy-ball method under the Łojasiewicz property, Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry, A forward-backward algorithm with different inertial terms for structured non-convex minimization problems, Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification, Local linear convergence of proximal coordinate descent algorithm, Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization, An explicit algorithm for solving monotone variational inequalities, Unnamed Item, Local linear convergence analysis of Primal–Dual splitting methods, Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions, Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions, On the interplay between acceleration and identification for the proximal gradient algorithm, On the linear convergence of forward-backward splitting method. I: Convergence analysis, Functional penalised basis pursuit on spheres, The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy, A projected extrapolated gradient method with larger step size for monotone variational inequalities, Faster subgradient methods for functions with Hölderian growth, Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation, An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization, ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?, Convergence rates of forward-Douglas-Rachford splitting method, A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization, Active‐Set Newton Methods and Partial Smoothness, Proximal Gradient Methods with Adaptive Subspace Sampling


Uses Software


Cites Work