Sparsity constrained nonlinear optimization: optimality conditions and algorithms
From MaRDI portal
Abstract: This paper treats the problem of minimizing a general continuously differentiable function subject to sparsity constraints. We present and analyze several different optimality criteria which are based on the notions of stationarity and coordinate-wise optimality. These conditions are then used to derive three numerical algorithms aimed at finding points satisfying the resulting optimality criteria: the iterative hard thresholding method and the greedy and partial sparse-simplex methods. The first algorithm is essentially a gradient projection method while the remaining two algorithms are of coordinate descent type. The theoretical convergence of these methods and their relations to the derived optimality conditions are studied. The algorithms and results are illustrated by several numerical examples.
Recommendations
- Greedy sparsity-constrained optimization
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- On solutions of sparsity constrained optimization
- Sparse Optimization with Least-Squares Constraints
- Nonsmooth sparsity constrained optimization problems: optimality conditions
Cited in
(only showing first 100 items - show all)- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- A Lagrange-Newton algorithm for sparse nonlinear programming
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- Newton method for \(\ell_0\)-regularized optimization
- Nomonotone spectral gradient method for sparse recovery
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
- A projected gradient method for nonlinear inverse problems with \(\alpha \ell_1 - \beta \ell_2\) sparsity regularization
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- Greedy approximation in convex optimization
- Nonlinear frames and sparse reconstructions in Banach spaces
- A quadratic penalty method for hypergraph matching
- On solutions of sparsity constrained optimization
- The first-order necessary conditions for sparsity constrained optimization
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- Descending iterative hard thresholding: a robust approach to sparse recovery under heavy-tailed noise
- Gradient projection Newton pursuit for sparsity constrained optimization
- Restricted normal cones and sparsity optimization with affine constraints
- An efficient sieving-based secant method for sparse optimization problems with least-squares constraints
- A novel nonconvex penalty method for a rank constrained matrix optimization problem and its applications
- Efficient projected gradient methods for cardinality constrained optimization
- Nonsmooth optimization method and sparsity
- Group Selection and Shrinkage: Structured Sparsity for Semiparametric Additive Models
- Optimality conditions and gradient descent Newton pursuit for 0/1-loss and sparsity constrained optimization
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- Constrained optimization involving nonconvex \(\ell_p\) norms: optimality conditions, algorithm and convergence
- Quaternion matrix optimization: motivation and analysis
- Inexact penalty decomposition methods for optimization problems with geometric constraints
- On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
- Nonconvex stochastic Bregman proximal gradient method with application to deep learning
- A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems
- A proximal gradient method for control problems with non-smooth and non-convex control cost
- A unifying framework for sparsity-constrained optimization
- Sparsity penalized mean-variance portfolio selection: analysis and computation
- On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach
- Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints
- Recognizing underlying sparsity in 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
- \(\alpha \ell_1 - \beta \ell_2\) sparsity regularization for nonlinear ill-posed problems
- Cardinality minimization, constraints, and regularization: a survey
- Dual formulation of the sparsity constrained optimization problem: application to classification
- Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization
- Sparse Optimization with Least-Squares Constraints
- Least sparsity of \(p\)-norm based optimization problems with \(p>1\)
- DC formulations and algorithms for sparse optimization problems
- Optimality conditions for non-negative group sparse constrained optimization problems
- A truncated Newton algorithm for nonconvex sparse recovery
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Solving equations of random convex functions via anchored regression
- Convex optimization and parsimony of \(L_p\)-balls representation
- Proximal mapping for symmetric penalty and sparsity
- Optimality conditions for rank-constrained matrix optimization
- The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems
- Sequential M-stationarity conditions for general optimization problems
- Heavy-ball-based relaxed optimal \(\mathrm{s}\)-thresholding algorithms for solving compressed sensing problem
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
- Grouped variable selection with discrete optimization: computational and statistical perspectives
- On the conjugate gradient subspace pursuit algorithm
- Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
- Critical point theory for sparse recovery
- The sparse principal component analysis problem: optimality conditions and algorithms
- On stationarity conditions and constraint qualifications for multiobjective optimization problems with cardinality constraints
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- Sparsity constrained optimization problems via disjunctive programming
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
- MIP-BOOST: Efficient and Effective L0 Feature Selection for Linear Regression
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
- An efficient Lagrange-Newton algorithm for long-only cardinality constrained portfolio selection on real data sets
- Subspace Newton method for sparse group \(\ell_0\) optimization problem
- Convergence of sparse coding based on KKT conditions
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- scientific article; zbMATH DE number 7415078 (Why is no real title available?)
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
- Sparse convex optimization toolkit: a mixed-integer framework
- Solution sets of three sparse optimization problems for multivariate regression
- Greedy sparsity-constrained optimization
- Optimization problems involving group sparsity terms
- Optimality conditions for sparse nonlinear programming
- Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms
- scientific article; zbMATH DE number 6982922 (Why is no real title available?)
- scientific article; zbMATH DE number 7370529 (Why is no real title available?)
- Optimality conditions and constraint qualifications for cardinality constrained optimization problems
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
- A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- A variational approach to sparsity optimization based on Lagrange multiplier theory
- Relaxation approaches for nonlinear sparse optimization problems
- Iterative hard-thresholding applied to optimal control problems with \(L^0(\Omega)\) control cost
- The non-convex sparse problem with nonnegative constraint for signal reconstruction
- Structural properties of affine sparsity constraints
- An effective procedure for feature subset selection in logistic regression based on information criteria
- Sequential optimality conditions for cardinality-constrained optimization problems with applications
- Trading accuracy for sparsity in optimization problems with sparsity constraints
This page was built for publication: Sparsity constrained nonlinear optimization: optimality conditions and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866194)
