A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems (Q6177008): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Convergence Guarantees of a Non-Convex Approach for Sparse Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composite Difference-Max Programs for Modern Statistical Estimation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapting to Unknown Smoothness via Wavelet Shrinkage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least angle regression. (With discussion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Dual Active Set Algorithm With Continuation for Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Statistical View of Some Chemometrics Regression Tools / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Primal-Dual Active Set Strategy as a Semismooth Newton Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified primal dual active set algorithm for nonconvex sparse recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable selection using MM algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC approximation approaches for sparse optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Newton-Type Methods for Minimizing Composite Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Lasso Cum EBIC for Feature Selection With Ultra-High Dimensional Feature Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>SparseNet</i>: Coordinate Descent With Nonconvex Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-dimensional graphs and variable selection with the Lasso / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity algorithms for image models: denoising / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Approximate Solutions to Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing B-Stationary Points of Nonsmooth DC Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5149020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calibrating nonconvex penalized regression in ultra-high dimension / 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: Nearly unbiased variable selection under minimax concave penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-step sparse estimates in nonconcave penalized likelihood models / rank
 
Normal rank

Latest revision as of 17:38, 2 August 2024

scientific article; zbMATH DE number 7732387
Language Label Description Also known as
English
A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems
scientific article; zbMATH DE number 7732387

    Statements

    A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems (English)
    0 references
    0 references
    0 references
    0 references
    29 August 2023
    0 references
    high-dimensional linear regression
    0 references
    global convergence
    0 references
    two-stage algorithm
    0 references
    primal dual active set with continuation algorithm
    0 references
    difference of convex functions
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers