Smoothing proximal gradient method for general structured sparse regression (Q439167): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DAVID / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPT3 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1005.4717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2880998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwise coordinate optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonsmooth version of Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasible semismooth asymptotically Newton method for mixed complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / 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: The solution path of the generalized lasso / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent algorithms for lasso penalized regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Selection and Estimation in Regression with Grouped Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing DNA copy number by penalized estimation and imputation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The composite absolute penalties family for grouped and hierarchical variable selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasi-Newton acceleration for high-dimensional optimization algorithms / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989060270 / rank
 
Normal rank

Latest revision as of 09:26, 30 July 2024

scientific article
Language Label Description Also known as
English
Smoothing proximal gradient method for general structured sparse regression
scientific article

    Statements

    Smoothing proximal gradient method for general structured sparse regression (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    structured sparsity
    0 references
    smoothing
    0 references
    proximal gradient
    0 references
    optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references