The following pages link to (Q4864293):
Displaying 50 items.
- Parametric and semiparametric reduced-rank regression with flexible sparsity (Q2018603) (← links)
- A distribution-based Lasso for a general single-index model (Q2018911) (← links)
- Complexity and applications of the homotopy principle for uniformly constrained sparse minimization (Q2019907) (← links)
- Greedy variance estimation for the LASSO (Q2019914) (← links)
- Elastic net penalized quantile regression model (Q2020507) (← links)
- An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity (Q2020598) (← links)
- Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute'' gradient for structured convex optimization (Q2020608) (← links)
- Identifying types in contest experiments (Q2021785) (← links)
- Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares (Q2021994) (← links)
- Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations (Q2022171) (← links)
- General splitting methods with linearization for the split feasibility problem (Q2022289) (← links)
- Asymptotic properties on high-dimensional multivariate regression M-estimation (Q2022560) (← links)
- Variable selection for partially linear models via Bayesian subset modeling with diffusing prior (Q2022563) (← links)
- Memory-based reduced modelling and data-based estimation of opinion spreading (Q2022637) (← links)
- On the interplay between acceleration and identification for the proximal gradient algorithm (Q2023654) (← links)
- Bayesian MIDAS penalized regressions: estimation, selection, and prediction (Q2024454) (← links)
- Model selection in utility-maximizing binary prediction (Q2024476) (← links)
- Quantile regression under local misspecification (Q2025221) (← links)
- A golden ratio primal-dual algorithm for structured convex optimization (Q2025858) (← links)
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems (Q2026765) (← links)
- Equivalence between adaptive Lasso and generalized ridge estimators in linear regression with orthogonal explanatory variables after optimizing regularization parameters (Q2027229) (← links)
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions (Q2028458) (← links)
- Globalized inexact proximal Newton-type methods for nonconvex composite functions (Q2028488) (← links)
- Penalized quasi-maximum likelihood estimation for extreme value models with application to flood frequency analysis (Q2028591) (← links)
- Simultaneous feature selection and clustering based on square root optimization (Q2028812) (← links)
- Regularizing axis-aligned ensembles via data rotations that favor simpler learners (Q2029102) (← links)
- Statistical inference for linear regression models with additive distortion measurement errors (Q2029215) (← links)
- Evaluating and selecting features via information theoretic lower bounds of feature inner correlations for high-dimensional data (Q2029330) (← links)
- Decision-based model selection (Q2029390) (← links)
- Lasso estimation for spherical autoregressive processes (Q2029797) (← links)
- A dual reformulation and solution framework for regularized convex clustering problems (Q2029898) (← links)
- Principal component analysis: a generalized Gini approach (Q2031094) (← links)
- A second-order adaptive Douglas-Rachford dynamic method for maximal \(\alpha\)-monotone operators (Q2031284) (← links)
- Block-based refitting in \(\ell_{12}\) sparse regularization (Q2031749) (← links)
- Variable smoothing for weakly convex composite functions (Q2031930) (← links)
- On the linear convergence of forward-backward splitting method. I: Convergence analysis (Q2031953) (← links)
- Convergent inexact penalty decomposition methods for cardinality-constrained problems (Q2031962) (← links)
- Robust estimation and variable selection in heteroscedastic regression model using least favorable distribution (Q2032187) (← links)
- Feature screening based on distance correlation for ultrahigh-dimensional censored data with covariate measurement error (Q2032190) (← links)
- A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems (Q2033078) (← links)
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets (Q2033090) (← links)
- Including news data in forecasting macro economic performance of China (Q2033701) (← links)
- Cyber claim analysis using generalized Pareto regression trees with applications to insurance (Q2034155) (← links)
- Estimation and optimal structure selection of high-dimensional Toeplitz covariance matrix (Q2034455) (← links)
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces (Q2035511) (← links)
- A study on distributed optimization over large-scale networked systems (Q2036031) (← links)
- A cost-sensitive constrained Lasso (Q2036145) (← links)
- Extending greedy feature selection algorithms to multiple solutions (Q2036770) (← links)
- Shrinkage estimation of the varying-coefficient model with continuous and categorical covariates (Q2036915) (← links)
- Machine learning based multiscale calibration of mesoscopic constitutive models for composite materials: application to brain white matter (Q2037488) (← links)
