Sparse convex optimization toolkit: a mixed-integer framework
From MaRDI portal
Abstract: This paper proposes an open-source distributed solver for solving Sparse Convex Optimization (SCO) problems over computational networks. Motivated by past algorithmic advances in mixed-integer optimization, the Sparse Convex Optimization Toolkit (SCOT) adopts a mixed-integer approach to find exact solutions to SCO problems. In particular, SCOT brings together various techniques to transform the original SCO problem into an equivalent convex Mixed-Integer Nonlinear Programming (MINLP) problem that can benefit from high-performance and parallel computing platforms. To solve the equivalent mixed-integer problem, we present the Distributed Hybrid Outer Approximation (DiHOA) algorithm that builds upon the LP/NLP based branch-and-bound and is tailored for this specific problem structure. The DiHOA algorithm combines the so-called single- and multi-tree outer approximation, naturally integrates a decentralized algorithm for distributed convex nonlinear subproblems, and utilizes enhancement techniques such as quadratic cuts. Finally, we present detailed computational experiments that show the benefit of our solver through numerical benchmarks on 140 SCO problems with distributed datasets. To show the overall efficiency of SCOT we also provide performance profiles comparing SCOT to other state-of-the-art MINLP solvers.
Recommendations
- Concave programming for finding sparse solutions to problems with convex constraints
- Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance
- Convex optimization under combinatorial sparsity constraints
- Sparse solutions of a class of constrained optimization problems
- A unifying framework for sparsity-constrained optimization
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- On solutions of sparsity constrained optimization
- A successive convex approximation approach for sparse solutions of convex programs
- Sparse optimization theory and methods
- A concave optimization-based approach for sparse multiobjective programming
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- A Scalable Algorithm for Sparse Portfolio Selection
- A mathematical introduction to compressive sensing
- A polyhedral branch-and-cut approach to global optimization
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Atomic decomposition by basis pursuit
- Best subset selection via a modern optimization lens
- Blockwise sparse regression
- Computational study of a family of mixed-integer quadratic programming problems
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Distributed primal outer approximation algorithm for sparse convex programming with separable structures
- Logistic regression: from art to science
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- Modeling languages in mathematical optimization.
- OSQP: an operator splitting solver for quadratic programs
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Quadratic Model Predictive Control Including Input Cardinality Constraints
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Reformulations for utilizing separability when solving convex MINLP problems
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving mixed integer nonlinear programs by outer approximation
- Sparse Approximate Solutions to Linear Systems
- Sparse Convex Regression
- Sparse classification: a scalable discrete optimization perspective
- Sparse regression over clusters: SparClur
- The supporting hyperplane optimization toolkit for convex MINLP
- Using regularization and second order information in outer approximation for convex MINLP
Cited in
(5)- 50 years of mixed-integer nonlinear and disjunctive programming
- Algorithm 813
- \texttt{skscope}: fast sparsity-constrained optimization in Python
- Distributed primal outer approximation algorithm for sparse convex programming with separable structures
- Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance
This page was built for publication: Sparse convex optimization toolkit: a mixed-integer framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087059)
