A unifying framework for sparsity-constrained optimization
From MaRDI portal
Abstract: In this paper, we consider the optimization problem of minimizing a continuously differentiable function subject to both convex constraints and sparsity constraints. By exploiting a mixed-integer reformulation from the literature, we define a necessary optimality condition based on a tailored neighborhood that allows to take into account potential changes of the support set. We then propose an algorithmic framework to tackle the considered class of problems and prove its convergence to points satisfying the newly introduced concept of stationarity. We further show that, by suitably choosing the neighborhood, other well-known optimality conditions from the literature can be recovered at the limit points of the sequence produced by the algorithm. Finally, we analyze the computational impact of the neighborhood size within our framework and in the comparison with some state-of-the-art algorithms, namely, the Penalty Decomposition method and the Greedy Sparse-Simplex method. The algorithms have been tested using a benchmark related to sparse logistic regression problems.
Recommendations
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Sparsity constrained optimization problems via disjunctive programming
- The first-order necessary conditions for sparsity constrained optimization
- On solutions of sparsity constrained optimization
- Greedy sparsity-constrained optimization
Cites work
- 10.1162/153244303322753751
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- A portfolio optimization model with three objectives and discrete variables
- A unified approach to mixed-integer optimization problems with logical constraints
- Algorithm for cardinality-constrained quadratic optimization
- An Algorithm Model for Mixed Variable Programming
- Benchmarking optimization software with performance profiles.
- Computational study of a family of mixed-integer quadratic programming problems
- 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
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- Heuristics for cardinality constrained portfolio optimization
- scientific article; zbMATH DE number 1906319 (Why is no real title available?)
- scientific article; zbMATH DE number 3186512 (Why is no real title available?)
- Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- Minimizing the tracking error of cardinality constrained portfolios
- Nonlinear integer programming
- On the limited memory BFGS method for large scale optimization
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- Optimization with sparsity-inducing penalties
- Portfolio selection using neural networks
- Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems
- Sparse Approximate Solutions to Linear Systems
- Sparse Approximation via Penalty Decomposition Methods
- Sparse regression: scalable algorithms and empirical performance
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- The effect of velocity sparsity on the performance of cardinality constrained particle swarm optimization
Cited in
(11)- Successive element correction algorithms for sparse unconstrained optimization
- Convex optimization under combinatorial sparsity constraints
- Restricted normal cones and sparsity optimization with affine constraints
- scientific article; zbMATH DE number 6253954 (Why is no real title available?)
- Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints
- Sparse convex optimization toolkit: a mixed-integer framework
- The greedy simplex algorithm for double sparsity constrained optimization problems
- A Path-Based Approach to Constrained Sparse Optimization
- Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms
- Combining gradient information and primitive directions for high-performance bound-constrained mixed-integer optimization
- Probabilistic iterative hard thresholding for sparse learning
This page was built for publication: A unifying framework for sparsity-constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6086139)
