On solutions of sparsity constrained optimization
From MaRDI portal
Recommendations
- The first-order necessary conditions for sparsity constrained optimization
- Nonsmooth sparsity constrained optimization problems: optimality conditions
- Sparsity constrained optimization problems via disjunctive programming
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Sparse solutions of a class of constrained optimization problems
Cites work
- A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
- Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
- Compressed sensing
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Decoding by Linear Programming
- Greedy sparsity-constrained optimization
- Iterative thresholding for sparse approximations
- Projected gradient methods for linearly constrained problems
- Restricted normal cones and sparsity optimization with affine constraints
- Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios
- Sparse Approximate Solutions to Linear Systems
- Sparse Approximation via Penalty Decomposition Methods
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Variational Analysis
Cited in
(35)- New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions
- Sparse Compression of Expected Solution Operators
- Sparse Optimization with Least-Squares Constraints
- Sparse convex optimization toolkit: a mixed-integer framework
- Sparsity constrained optimization problems via disjunctive programming
- On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
- On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach
- Second-Order Conditions for the Existence of Augmented Lagrange Multipliers for Sparse Optimization
- Newton hard-thresholding pursuit for sparse linear complementarity problem via a new merit function
- Gradient projection Newton pursuit for sparsity constrained optimization
- Optimality conditions for sparse nonlinear programming
- Cardinality minimization, constraints, and regularization: a survey
- Optimality conditions and constraint qualifications for cardinality constrained optimization problems
- Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance
- Orbital geometry and group majorisation in optimisation
- DC formulations and algorithms for sparse optimization problems
- A quadratic penalty method for hypergraph matching
- Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
- First- and second-order optimality conditions of nonsmooth sparsity multiobjective optimization via variational analysis
- scientific article; zbMATH DE number 6253954 (Why is no real title available?)
- Global optimization for sparse solution of least squares problems
- Hyper-sparsity in the revised simplex method and how to exploit it
- \texttt{skscope}: fast sparsity-constrained optimization in Python
- A greedy Newton-type method for multiple sparse constraint problem
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications
- Structural properties of affine sparsity constraints
- The first-order necessary conditions for sparsity constrained optimization
- A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization
- Lagrangian duality and saddle points for sparse linear programming
- Nonsmooth sparsity constrained optimization problems: optimality conditions
- Restricted normal cones and sparsity optimization with affine constraints
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- A Lagrange-Newton algorithm for sparse nonlinear programming
- A unifying framework for sparsity-constrained optimization
This page was built for publication: On solutions of sparsity constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259112)
