Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality Loss, and Algorithms

Published Online:https://doi.org/10.1287/opre.2023.0254

References

  • Ahmed S, Guan Y (2005) The inverse optimal value problem. Math. Programming 102:91–110.CrossrefGoogle Scholar
  • Ahuja RK, Orlin JB (2001) Inverse optimization. Oper. Res. 49(5):771–783.LinkGoogle Scholar
  • Akhtar SA, Kolarijani AS, Mohajerin Esfahani P (2021) Learning for control: An inverse optimization approach. Proc. Amer. Control Conf., ACC 2021 (IEEE, Piscataway, NJ), 2193–2198.Google Scholar
  • Allen-Zhu Z, Orecchia L (2014) Linear coupling: An ultimate unification of gradient and mirror descent. Preprint, submitted July 6, https://arxiv.org/abs/1407.1537.Google Scholar
  • Amazon.com, Inc. (2021) Last-mile routing challenge team performance and leaderboard. Accessed August 26, 2024, https://routingchallenge.mit.edu/last-mile-routing-challenge-team-performance-and-leaderboard/.Google Scholar
  • Aswani A, Shen ZJ, Siddiq A (2018) Inverse optimization with noisy data. Oper. Res. 66(3):870–892.LinkGoogle Scholar
  • Bärmann A, Pokutta S, Schneider O (2017) Emulating the expert: Inverse optimization through online learning. Internat. Conf. Machine Learn. (PMLR, New York), 400–410.Google Scholar
  • Bertsekas DP (2008) Nonlinear Programming (Athena Scientific, Belmont, MA).Google Scholar
  • Bertsekas DP (2015) Convex Optimization Algorithms (Athena Scientific, Belmont, MA).Google Scholar
  • Bertsimas D, Gupta V, Paschalidis IC (2012) Inverse optimization: A new perspective on the Black–Litterman model. Oper. Res. 60(6):1389–1403.LinkGoogle Scholar
  • Bertsimas D, Gupta V, Paschalidis IC (2015) Data-driven estimation in equilibrium using inverse optimization. Math. Programming 153(2):595–633.CrossrefGoogle Scholar
  • Besbes O, Fonseca Y, Lobel I (2023) Contextual inverse optimization: Offline and online learning. Oper. Res., ePub ahead of print August 2, https://doi.org/10.1287/opre.2021.0369.LinkGoogle Scholar
  • Bodur M, Chan TCY, Zhu IY (2022) Inverse mixed integer optimization: Polyhedral insights and trust region methods. INFORMS J. Comput. 34(3):1471–1488.LinkGoogle Scholar
  • Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • Bubeck S (2015) Convex Optimization: Algorithms and Complexity, Foundations and Trends in Machine Learning (Now Publishers, Delft, Netherlands).CrossrefGoogle Scholar
  • Burton D, Toint PL (1992) On an instance of the inverse shortest paths problem. Math. Programming 53:45–61.CrossrefGoogle Scholar
  • Chan TCY, Lee T, Terekhov D (2019) Inverse optimization: Closed-form solutions, geometry, and goodness of fit. Management Sci. 65(3):1115–1135.LinkGoogle Scholar
  • Chan TCY, Mahmood R, Zhu IY (2023) Inverse optimization: Theory and applications. Oper. Res., ePub ahead of print December 19, https://doi.org/10.1287/opre.2022.0382.LinkGoogle Scholar
  • Chan TCY, Craig T, Lee T, Sharpe MB (2014) Generalized inverse multiobjective optimization with application to cancer therapy. Oper. Res. 62(3):680–695.LinkGoogle Scholar
  • Chan TCY, Eberg M, Forster K, Holloway C, Ieraci L, Shalaby Y, Yousefi N (2022) An inverse optimization approach to measuring clinical pathway concordance. Management Sci. 68(3):1882–1903.LinkGoogle Scholar
  • Chen VX, Kılınç-Karzan F (2020) Online convex optimization perspective for learning from dynamically revealed preferences. Preprint, submitted August 24, https://arxiv.org/abs/2008.10460.Google Scholar
  • Chow JYJ, Recker WW (2012) Inverse optimization with endogenous arrival time constraints to calibrate the household activity pattern problem. Transportation Res. Part B Methodological 46(3):463–479.CrossrefGoogle Scholar
  • Elmachtoub AN, Grigas P (2022) Smart “predict, then optimize.” Management Sci. 68(1):9–26.LinkGoogle Scholar
  • Faragó A, Szentesi Á, Szviatovszki B (2003) Inverse optimization in high-speed networks. Discrete Appl. Math. 129(1):83–98.CrossrefGoogle Scholar
  • Ghobadi K, Mahmoudzadeh H (2021) Inferring linear feasible regions using inverse optimization. Eur. J. Oper. Res. 290(3):829–843.CrossrefGoogle Scholar
  • Ghobadi K, Lee T, Mahmoudzadeh H, Terekhov D (2018) Robust inverse optimization. Oper. Res. Lett. 46(3):339–344.CrossrefGoogle Scholar
  • Heuberger C (2004) Inverse combinatorial optimization: A survey on problems, methods, and results. J. Combinatorial Optim. 8:329–361.CrossrefGoogle Scholar
  • Iyengar G, Kang W (2005) Inverse conic programming with applications. Oper. Res. Lett. 33(3):319–330.CrossrefGoogle Scholar
  • Joachims T, Finley T, Yu CNJ (2009) Cutting-plane training of structural SVMs. Machine Learn. 77(1):27–59.CrossrefGoogle Scholar
  • Juditsky A, Nemirovski A (2011) First order methods for nonsmooth convex large-scale optimization. I. General purpose methods. Optim. Machine Learn. 30(9):121–148.Google Scholar
  • Keshavarz A, Wang Y, Boyd S (2011) Imputing a convex objective function. 2011 IEEE Internat. Sympos. Intelligent Control (IEEE, Piscataway, NJ), 613–619.Google Scholar
  • Lu H, Freund RM, Nesterov Y (2018) Relatively smooth convex optimization by first-order methods, and applications. SIAM J. Optim. 28(1):333–354.CrossrefGoogle Scholar
  • Mohajerin Esfahani P, Shafieezadeh-Abadeh S, Hanasusanto GA, Kuhn D (2018) Data-driven inverse optimization with imperfect information. Math. Programming 167(1):191–234.CrossrefGoogle Scholar
  • Nemirovski A (1996) Lecture notes: Interior point polynomial methods in convex programming. Accessed August 26, 2024, https://www2.isye.gatech.edu/~nemirovs/Lect_IPM.pdf.Google Scholar
  • Nemirovski A (2004) Prox-method with rate of convergence O(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15(1):229–251.CrossrefGoogle Scholar
  • Nesterov Y (2007) Dual extrapolation and its applications to solving variational inequalities and related problems. Math. Programming 109(2–3):319–344.CrossrefGoogle Scholar
  • Nowozin S, Lampert CH (2011) Structured learning and prediction in computer vision. Foundations Trends Comput. Graphics Vision 6(3–4):185–365.Google Scholar
  • Orabona F (2019) A modern introduction to online learning. Preprint, submitted December 31, https://arxiv.org/abs/1912.13213.Google Scholar
  • Ratliff ND, Bagnell JA, Zinkevich MA (2006) Maximum margin planning. Proc. 23rd Internat. Conf. Machine Learn. (ACM, New York), 729–736.Google Scholar
  • Ratliff ND, Bagnell JA, Zinkevich MA (2007) (Approximate) subgradient methods for structured prediction. Proc. Eleventh Internat. Conf. Artificial Intelligence Statist., vol. 2 (PMLR, New York), 380–387.Google Scholar
  • Saez-Gallego J, Morales JM (2017) Short-term forecasting of price-responsive loads using inverse optimization. IEEE Trans. Smart Grid 9(5):4805–4814.CrossrefGoogle Scholar
  • Schaefer AJ (2009) Inverse integer programming. Optim. Lett. 3:483–489.CrossrefGoogle Scholar
  • Shor NZ (1985) Minimization Methods for Non-Differentiable Functions, Springer Series in Computational Mathematics (Springer, Cham, Switzerland).CrossrefGoogle Scholar
  • Taskar B, Lacoste-Julien S, Jordan MI (2006) Structured prediction, dual extragradient and Bregman projections. J. Machine Learn. Res. 7(60):1627–1653.Google Scholar
  • Taskar B, Chatalbashev V, Koller D, Guestrin C (2005) Learning structured prediction models: A large margin approach. Proc. 22nd Internat. Conf. Machine Learn. (ACM, New York), 896–903.Google Scholar
  • Taşkesen B, Shafieezadeh-Abadeh S, Kuhn D (2023) Semi-discrete optimal transport: Hardness, regularization and numerical solution. Math. Programming 199:1033–1106.CrossrefGoogle Scholar
  • Teo CH, Vishwanathan SVN, Smola A, Le QV (2010) Bundle methods for regularized risk minimization. J. Machine Learn. Res. 11(10):311–365.Google Scholar
  • Tibshirani R (1996) Regression shrinkage and selection via the lasso. J. Roy. Statist. Soc. Ser. B Statist. Methodology 58(1):267–288.CrossrefGoogle Scholar
  • Tsochantaridis I, Joachims T, Hofmann T, Altun Y, Singer Y (2005) Large margin methods for structured and interdependent output variables. J. Machine Learn. Res. 6(9):1453–1484.Google Scholar
  • Wang L (2009) Cutting plane algorithms for the inverse mixed integer linear programming problem. Oper. Res. Lett. 37(2):114–116.CrossrefGoogle Scholar
  • Zattoni Scroccaro P (2023) InvOpt: An open-source Python package to solve Inverse Optimization problems. https://github.com/pedroszattoni/invopt.Google Scholar
  • Zattoni Scroccaro P, van Beek P, Mohajerin Esfahani P, Atasoy B (2024) Inverse optimization for routing problems. Transportation Sci., ePub ahead of print July 17, https://doi.org/10.1287/trsc.2023.0241.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.