Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
From MaRDI portal
Publication:5085481
DOI10.1287/IJOC.2020.0993OpenAlexW3101808689MaRDI QIDQ5085481FDOQ5085481
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
Cites Work
- GLOMIQO: global mixed-integer quadratic optimizer
- An Introduction to Statistical Learning
- Greedy function approximation: A gradient boosting machine.
- Principal component analysis.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random forests
- Optimization by Simulated Annealing
- Mixed-integer nonlinear optimization
- Title not available (Why is that?)
- Stochastic gradient boosting.
- Title not available (Why is that?)
- A polyhedral branch-and-cut approach to global optimization
- Branching rules revisited
- Boosting a weak learning algorithm by majority
- Computational study of a family of mixed-integer quadratic programming problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Branching and bounds tighteningtechniques for non-convex MINLP
- The cluster problem in multivariate global optimization
- Recent advances in the solution of quadratic assignment problems
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
- The cluster problem revisited
- Solving large quadratic assignment problems on computational grids
- Solving large airline crew scheduling problems: Random pairing generation and strong branching
- Piecewise-linear approximations of multidimensional functions
- Strong-branching inequalities for convex mixed integer nonlinear programs
- Empirical decision model learning
- Auction optimization using regression trees and linear models as integer programs
- Embedding Decision Trees and Random Forests in Constraint Programming
- Deterministic global optimization with artificial neural networks embedded
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Extremely randomized trees
- The cluster problem in constrained global optimization
- Pyomo -- optimization modeling in Python
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
Cited In (6)
- Piecewise linear trees as surrogate models for system design and planning under high-frequency temporal variability
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- Surrogate-Based Reduced-Dimension Global Optimization in Process Systems Engineering
- Global and preference-based optimization with mixed variables using piecewise affine surrogates
- Global optimization: a machine learning approach
- Optimization over decision trees: a case study for the design of stable direct-current electricity networks
Uses Software
This page was built for publication: Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085481)
