Distributed primal outer approximation algorithm for sparse convex programming with separable structures
From MaRDI portal
Publication:6173959
DOI10.1007/s10898-022-01266-5zbMath1530.90077arXiv2210.06913OpenAlexW4312118294MaRDI QIDQ6173959
Eduardo Camponogara, Paulo R. C. Mendes, Unnamed Author
Publication date: 13 July 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.06913
Convex programming (90C25) Mixed integer programming (90C11) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (max. 100)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Best subset selection via a modern optimization lens
- Feature selection for support vector machines using generalized Benders decomposition
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Reformulations for utilizing separability when solving convex MINLP problems
- Iterative hard thresholding for compressed sensing
- Algorithm for cardinality-constrained quadratic optimization
- The restricted isometry property and its implications for compressed sensing
- Solving mixed integer nonlinear programs by outer approximation
- Logistic regression: from art to science
- Computational study of a family of mixed-integer quadratic programming problems
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Partially distributed outer approximation
- Sparse classification: a scalable discrete optimization perspective
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- A new algorithm for quadratic integer programming problems with cardinality constraint
- Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
- Using regularization and second order information in outer approximation for convex MINLP
- Generalized Benders decomposition
- Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables
- Distributed Optimization Over Time-Varying Directed Graphs
- Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance
- An Introduction to Statistical Learning
- Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
- Sparse Convex Regression
- A Scalable Algorithm for Sparse Portfolio Selection
- Quadratic Model Predictive Control Including Input Cardinality Constraints
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
This page was built for publication: Distributed primal outer approximation algorithm for sparse convex programming with separable structures
