Gradient boosting for convex cone predict and optimize problems

DOI10.1016/j.orl.2022.12.006zbMath1525.90330arXiv2204.06895OpenAlexW4313350174MaRDI QIDQ6161287

Roy H. Kwon, Unnamed Author

Publication date: 27 June 2023

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.06895

zbMATH Keywords

convex optimizationgradient boostingdecision tree regression

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25)

Cites Work

• Greedy function approximation: A gradient boosting machine.
• Hybrid classification and reasoning for image-based constraint solving
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Implicit Functions and Solution Mappings
• Random forests

This page was built for publication: Gradient boosting for convex cone predict and optimize problems