Learning to optimize: A tutorial for continuous and mixed-integer optimization

被引:0
|
作者
Chen, Xiaohan [1 ]
Liu, Jialin [1 ]
Yin, Wotao [1 ]
机构
[1] Alibaba DAMO Acad, Decis Intelligence Lab, Bellevue, WA 98004 USA
关键词
AI for mathematics (AI4Math); learning to optimize; algorithm unrolling; plug-and-play methods; differentiable programming; machine learning for combinatorial optimization (ML4CO); BILEVEL OPTIMIZATION; ALGORITHM;
D O I
10.1007/s11425-023-2293-3
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Learning to optimize (L2O) stands at the intersection of traditional optimization and machine learning, utilizing the capabilities of machine learning to enhance conventional optimization techniques. As real-world optimization problems frequently share common structures, L2O provides a tool to exploit these structures for better or faster solutions. This tutorial dives deep into L2O techniques, introducing how to accelerate optimization algorithms, promptly estimate the solutions, or even reshape the optimization problem itself, making it more adaptive to real-world applications. By considering the prerequisites for successful applications of L2O and the structure of the optimization problems at hand, this tutorial provides a comprehensive guide for practitioners and researchers alike.
引用
收藏
页码:1191 / 1262
页数:72
相关论文
共 50 条
  • [21] New Reflection Generator for Simulated Annealing in Mixed-Integer/Continuous Global Optimization
    H. E. Romeijn
    Z. B. Zabinsky
    D. L. Graesser
    S. Neogi
    Journal of Optimization Theory and Applications, 1999, 101 : 403 - 427
  • [22] Adjustable robust superstructure optimization with mixed-integer recourse for the continuous rufinamide manufacturing
    Qiu, Taoyu
    Yang, Wenhui
    Ge, Congqin
    Zhang, Lifeng
    Yuan, Zhihong
    AICHE JOURNAL, 2025,
  • [23] Erratum to: CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
    Henrik A. Friberg
    Mathematical Programming Computation, 2016, 8 (2) : 215 - 216
  • [24] Mixed-integer programming models for the scheduling and operational optimization of multiproduct continuous plants
    Alle, A
    Pinto, JM
    INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2002, 41 (11) : 2689 - 2704
  • [25] Polyhedral approximation in mixed-integer convex optimization
    Lubin, Miles
    Yamangil, Emre
    Bent, Russell
    Vielma, Juan Pablo
    MATHEMATICAL PROGRAMMING, 2018, 172 (1-2) : 139 - 168
  • [26] Granularity for Mixed-Integer Polynomial Optimization Problems
    Eggen, Carl
    Stein, Oliver
    Volkwein, Stefan
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2025, 205 (02)
  • [27] Split cuts for robust mixed-integer optimization
    Haus, Utz-Uwe
    Pfeuffer, Frank
    OPERATIONS RESEARCH LETTERS, 2012, 40 (03) : 165 - 171
  • [28] Polyhedral approximation in mixed-integer convex optimization
    Miles Lubin
    Emre Yamangil
    Russell Bent
    Juan Pablo Vielma
    Mathematical Programming, 2018, 172 : 139 - 168
  • [29] MISO: mixed-integer surrogate optimization framework
    Juliane Müller
    Optimization and Engineering, 2016, 17 : 177 - 203
  • [30] Minotaur: a mixed-integer nonlinear optimization toolkit
    Ashutosh Mahajan
    Sven Leyffer
    Jeff Linderoth
    James Luedtke
    Todd Munson
    Mathematical Programming Computation, 2021, 13 : 301 - 338