A unifying framework for sparsity-constrained optimization

DOI10.1007/s10957-023-02306-0arXiv2104.13244OpenAlexW4287198943MaRDI QIDQ6086139

Matteo Lapucci, Tommaso Levato, Marco Sciandrone, Francesco Rinaldi

Publication date: 9 November 2023

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.13244

zbMATH Keywords

numerical methodsoptimality conditionsstationarityasymptotic convergencesparse logistic regressionsparsity-constrained problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Unnamed Item
• Unnamed Item
• Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
• Algorithm for cardinality-constrained quadratic optimization
• Portfolio selection using neural networks
• On the limited memory BFGS method for large scale optimization
• Heuristics for cardinality constrained portfolio optimization
• Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
• Minimizing the tracking error of cardinality constrained portfolios
• Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems
• Computational study of a family of mixed-integer quadratic programming problems
• Convergent inexact penalty decomposition methods for cardinality-constrained problems
• The effect of velocity sparsity on the performance of cardinality constrained particle swarm optimization
• Sparse regression: scalable algorithms and empirical performance
• Nonlinear integer programming
• A portfolio optimization model with three objectives and discrete variables
• On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
• Optimization with Sparsity-Inducing Penalties
• Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
• 10.1162/153244303322753751
• Sparse Approximate Solutions to Linear Systems
• A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints
• An Algorithm Model for Mixed Variable Programming
• Sparse Approximation via Penalty Decomposition Methods
• Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
• Benchmarking optimization software with performance profiles.

This page was built for publication: A unifying framework for sparsity-constrained optimization