Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations (Q2022171): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q126801873, #quickstatements; #temporary_batch_1719321775979
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: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistics for high-dimensional data. Methods, theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous analysis of Lasso and Dantzig selector / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder). / 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: Structural properties of affine sparsity constraints / 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: Nonconcave Penalized Likelihood With NP-Dimensionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5251797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics for Lasso-type estimators. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC approximation approaches for sparse optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Support recovery without incoherence: a case for nonconvex regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point source super-resolution via non-convex \(L_1\) based methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confidence Intervals and Regions for the Lasso by Using Stochastic Variational Inequality Techniques in Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Strong Homogeneity of a Regularized Estimator / 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: Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of $\ell_{1-2}$ for Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing / 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: Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Adaptive Lasso and Its Oracle Properties / rank
 
Normal rank

Latest revision as of 15:51, 25 July 2024

scientific article
Language Label Description Also known as
English
Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations
scientific article

    Statements

    Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations (English)
    0 references
    0 references
    28 April 2021
    0 references
    non-convex optimization
    0 references
    sparse learning
    0 references
    difference-of-convex program
    0 references
    directional stationary solution
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers