Proximal Gradient Methods with Adaptive Subspace Sampling (Q5026438): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Optimization with Sparsity-Inducing Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and monotone operator theory in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Goldstein-Levitin-Polyak gradient projection method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2809807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Identification of Active Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing sparsity by reweighted \(\ell _{1}\) minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Thresholding Algorithm for Minimization over Orthonormal Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Splitting Methods in Signal Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: De-noising by soft-thresholding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality, identifiability, and sensitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity Analysis for Mirror-Stratifiable Convex Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4665560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active Sets, Nonsmoothness, and Sensitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Activity Identification and Local Linear Convergence of Forward--Backward-type Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent with arbitrary sampling I: algorithms and complexity<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal probabilities in stochastic coordinate descent methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity and Smoothness Via the Fused Lasso / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a block coordinate descent method for nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model selection with low complexity priors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifiable Surfaces in Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Block-coordinate Relaxation for Regularized Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent algorithms / rank
 
Normal rank

Revision as of 22:30, 27 July 2024

scientific article; zbMATH DE number 7470604
Language Label Description Also known as
English
Proximal Gradient Methods with Adaptive Subspace Sampling
scientific article; zbMATH DE number 7470604

    Statements

    Proximal Gradient Methods with Adaptive Subspace Sampling (English)
    0 references
    0 references
    0 references
    0 references
    8 February 2022
    0 references
    nonsmooth optimization
    0 references
    identification
    0 references
    proximal gradient algorithm
    0 references
    randomized methods
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references