Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
From MaRDI portal
Publication:5085481
Recommendations
- Optimization of tree ensembles
- Gradient boosting for convex cone predict and optimize problems
- Optimization over decision trees: a case study for the design of stable direct-current electricity networks
- Optimal decision trees for categorical data via integer programming
- Mathematical optimization in classification and regression trees
Cites work
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- A polyhedral branch-and-cut approach to global optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- An exact solution approach for portfolio optimization problems under stochastic and integer constraints
- An introduction to statistical learning. With applications in R
- Auction optimization using regression trees and linear models as integer programs
- Boosting a weak learning algorithm by majority
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Branching and bounds tighteningtechniques for non-convex MINLP
- Branching rules revisited
- Computational study of a family of mixed-integer quadratic programming problems
- Deterministic global optimization with artificial neural networks embedded
- Embedding decision trees and random forests in constraint programming
- Empirical decision model learning
- Extremely randomized trees
- GLOMIQO: global mixed-integer quadratic optimizer
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Greedy function approximation: A gradient boosting machine.
- Handbook of constraint programming.
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Mixed-integer nonlinear optimization
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Optimization by simulated annealing
- Piecewise-linear approximations of multidimensional functions
- Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
- Principal component analysis.
- Pyomo -- optimization modeling in Python
- Random forests
- Recent advances in the solution of quadratic assignment problems
- Solving large airline crew scheduling problems: Random pairing generation and strong branching
- Solving large quadratic assignment problems on computational grids
- Stochastic gradient boosting.
- Strong-branching inequalities for convex mixed integer nonlinear programs
- The cluster problem in constrained global optimization
- The cluster problem in multivariate global optimization
- The cluster problem revisited
Cited in
(7)- Piecewise linear trees as surrogate models for system design and planning under high-frequency temporal variability
- Gradient boosting for convex cone predict and optimize problems
- 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
Describes a project that uses
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)
