Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
From MaRDI portal
Publication:5085481
DOI10.1287/ijoc.2020.0993OpenAlexW3101808689MaRDI QIDQ5085481
Miten Mistry, Robert M. Lee, Dimitrios Letsios, Gerhard Krennrich, Ruth Misener
Publication date: 27 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.00952
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedy function approximation: A gradient boosting machine.
- Optimization by Simulated Annealing
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- GLOMIQO: global mixed-integer quadratic optimizer
- Strong-branching inequalities for convex mixed integer nonlinear programs
- Empirical decision model learning
- Auction optimization using regression trees and linear models as integer programs
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- The cluster problem revisited
- Piecewise-linear approximations of multidimensional functions
- The cluster problem in multivariate global optimization
- Recent advances in the solution of quadratic assignment problems
- The cluster problem in constrained global optimization
- Deterministic global optimization with artificial neural networks embedded
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- A polyhedral branch-and-cut approach to global optimization
- Computational study of a family of mixed-integer quadratic programming problems
- Solving large quadratic assignment problems on computational grids
- Principal component analysis.
- Branching rules revisited
- Boosting a weak learning algorithm by majority
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Branching and bounds tighteningtechniques for non-convex MINLP
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- An Introduction to Statistical Learning
- Mixed-integer nonlinear optimization
- Embedding Decision Trees and Random Forests in Constraint Programming
- Extremely randomized trees
- Pyomo -- optimization modeling in Python
- Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
- Solving large airline crew scheduling problems: Random pairing generation and strong branching
- Random forests
- Stochastic gradient boosting.