Sparse convex optimization toolkit: a mixed-integer framework
From MaRDI portal
Publication:6087059
DOI10.1080/10556788.2023.2222429arXiv2210.16896MaRDI QIDQ6087059
Jan Kronqvist, Eduardo Camponogara, Unnamed Author
Publication date: 11 December 2023
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.16896
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- OSQP: An Operator Splitting Solver for Quadratic Programs
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Best subset selection via a modern optimization lens
- A mathematical introduction to compressive sensing
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Reformulations for utilizing separability when solving convex MINLP problems
- An algorithmic framework for convex mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- Modeling languages in mathematical optimization.
- Logistic regression: from art to science
- A polyhedral branch-and-cut approach to global optimization
- Computational study of a family of mixed-integer quadratic programming problems
- Review of nonlinear mixed-integer and disjunctive programming techniques
- 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
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Atomic Decomposition by Basis Pursuit
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Sparse Approximate Solutions to Linear Systems
- Sparse Convex Regression
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- A Scalable Algorithm for Sparse Portfolio Selection
- Quadratic Model Predictive Control Including Input Cardinality Constraints
- Distributed primal outer approximation algorithm for sparse convex programming with separable structures
This page was built for publication: Sparse convex optimization toolkit: a mixed-integer framework