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)- Recognizing underlying sparsity in optimization
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
- Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems
- Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
- Efficient projected gradient methods for cardinality constrained optimization
- DC formulations and algorithms for sparse optimization problems
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization
- Lagrangian duality and saddle points for sparse linear programming
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- Convergent inexact penalty decomposition methods for cardinality-constrained 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
- An effective procedure for feature subset selection in logistic regression based on information criteria
- Sequential optimality conditions for cardinality-constrained optimization problems with applications
- On DC based methods for phase retrieval
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
- Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration
- A Lagrange-Newton algorithm for sparse nonlinear programming
- Sparse regression at scale: branch-and-bound rooted in first-order optimization
- Convex optimization under combinatorial sparsity constraints
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
- Quaternion matrix optimization: motivation and analysis
- A truncated Newton algorithm for nonconvex sparse recovery
- An interior stochastic gradient method for a class of non-Lipschitz optimization problems
- Gradient projection Newton pursuit for sparsity constrained optimization
- Inexact version of Bregman proximal gradient algorithm
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
- A proximal gradient method for control problems with non-smooth and non-convex control cost
- On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers
- Safe feature elimination for non-negativity constrained convex optimization
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
- Nonsmooth sparsity constrained optimization problems: optimality conditions
- Optimality conditions for rank-constrained matrix optimization
- Solving equations of random convex functions via anchored regression
- Optimization problems involving group sparsity terms
- Greedy approximation in convex optimization
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
- Optimality conditions for sparse nonlinear programming
- A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares
- Structural properties of affine sparsity constraints
- Phase retrieval: stability and recovery guarantees
- Nomonotone spectral gradient method for sparse recovery
- On solutions of sparsity constrained optimization
- The first-order necessary conditions for sparsity constrained optimization
- Newton method for \(\ell_0\)-regularized optimization
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- A greedy Newton-type method for multiple sparse constraint problem
- Morozov's discrepancy principle for _1-_2 sparsity regularization
- Duality and Convex Programming
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- Nonsmooth optimization method and sparsity
- The sparse principal component analysis problem: optimality conditions and algorithms
- Trading accuracy for sparsity in optimization problems with sparsity constraints
- Concave programming for finding sparse solutions to problems with convex constraints
- Iterative hard-thresholding applied to optimal control problems with L^0() control cost
- Sparse Optimization with Least-Squares Constraints
- The non-convex sparse problem with nonnegative constraint for signal reconstruction
- Convergence of sparse coding based on KKT conditions
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- Restricted normal cones and sparsity optimization with affine constraints
- scientific article; zbMATH DE number 6982922 (Why is no real title available?)
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Gradient-based method with active set strategy for \(\ell _1\) optimization
- Proximal mapping for symmetric penalty and sparsity
- Least sparsity of \(p\)-norm based optimization problems with \(p>1\)
- Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
- Some advances in theory and algorithms for sparse optimization
- Global and quadratic convergence of Newton hard-thresholding pursuit
- Sparse convex optimization via adaptively regularized hard thresholding
- Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
- First-order algorithms for a class of fractional optimization problems
- Sparsity constrained optimization problems via disjunctive programming
- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
- MIP-BOOST: Efficient and Effective L0 Feature Selection for Linear Regression
- The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- Dual iterative hard thresholding
- The analysis of alternating minimization method for double sparsity constrained optimization problem
- Learning sparse classifiers: continuous and mixed integer optimization perspectives
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- Quasi-linear compressed sensing
- Total variation reconstruction from quadratic measurements
- An inexact projected gradient method for sparsity-constrained quadratic measurements regression
- Greedy sparsity-constrained optimization
- A variational approach to sparsity optimization based on Lagrange multiplier theory
- Algorithm 813
- Convex optimization and parsimony of L_p-balls representation
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- A survey on compressive sensing: classical results and recent advancements
- Critical point theory for sparse recovery
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms
- Grouped variable selection with discrete optimization: computational and statistical perspectives
- Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
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)
