Probabilistic iterative hard thresholding for sparse learning
From MaRDI portal
Cites work
- A Path-Based Approach to Constrained Sparse Optimization
- A unifying framework for sparsity-constrained optimization
- An adaptive Monte Carlo algorithm for computing mixed logit estimators
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
- Convergence of trust-region methods based on probabilistic models
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- Critical point theory for sparse recovery
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
- High-dimensional statistics. A non-asymptotic viewpoint
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- Iterative thresholding for sparse approximations
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems
- Sequential optimality conditions for cardinality-constrained optimization problems with applications
- Sparse Approximation via Penalty Decomposition Methods
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Stochastic optimization using a trust-region method and random models
This page was built for publication: Probabilistic iterative hard thresholding for sparse learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6872938)
