Fetching the paper…
Reading the bibliography…
Bilevel programs are optimization problems where some variables are solutions to optimization problems themselves, and they arise in a variety of control applications, including: control of vehicle traffic networks, inverse reinforcement learning and inverse optimization, and robust control for human-automation systems.
C. Berge, Topological Spaces: including a treatment of multi-valued functions, vector spaces, and convexity . Dover, 1963
1963
Earlier work this paper cites.
R. T. Rockafellar, Convex Analysis . Princeton University Press, 1970
1970
Earlier work this paper cites.
F. H. Clarke, “Generalized gradients and applications,” Transactions of the American Mathematical Society , vol. 205, pp. 247–262, 1975
1975
Earlier work this paper cites.
J.-B. Hiriart-Urruty, “Refinements of necessary optimality conditions in nondifferentiable programming I,” Applied mathematics and optimization , vol. 5, no. 1, pp. 63–82, 1979
1979
Earlier work this paper cites.
R. Rockafellar, “Favorable classes of Lipschitz continuous functions in subgradient optimization,” in Progress in Nondifferentiable Optimization . IIASA, 1982, pp. 125–143
1982
Earlier work this paper cites.
J. V. Outrata, “On the numerical solution of a class of Stackelberg problems,” Zeitschrift für Operations Research , vol. 34, no. 4, pp. 255–277, 1990
1990
Earlier work this paper cites.
Y. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming . SIAM, 1994
1994
Earlier work this paper cites.
J. Ye and D. Zhu, “Optimality conditions for bilevel programming problems,” Optimization , vol. 33, no. 1, pp. 9–27, 1995
1995
Earlier work this paper cites.
E. Polak, Optimization: algorithms and consistent approximations . Springer Science & Business Media, 1997, vol. 124
1997
Earlier work this paper cites.
M. Fukushima and J.-S. Pang, “Convergence of a smoothing continuation method for mathematical programs with complementarity constraints,” in Ill-posed Variational Problems and Regularization Techniques . Springer, 1999, pp. 99–110
1999
Earlier work this paper cites.
A. Ng and S. Russell, “Algorithms for inverse reinforcement learning.” in ICML , 2000, pp. 663–670
2000
Earlier work this paper cites.
J. Bonnans and A. Shapiro, Perturbation Analysis of Optimization Problems . Springer, 2000
2000
Earlier work this paper cites.
H. Scheel and S. Scholtes, “Mathematical programs with complementarity constraints: Stationarity, optimality, and sensitivity,” Math. Oper. Res. , vol. 25, no. 1, pp. 1–22, 2000
2000
Earlier work this paper cites.
S. Scholtes, “Convergence properties of a regularization scheme for mathematical programs with complementarity constraints,” SIAM Journal on Optimization , vol. 11, no. 4, pp. 918–936, 2001
2001
Cited alongside, same era.
T. Roughgarden, “The price of anarchy is independent of the network topology,” J. Comput. Syst. Sci. , vol. 67, no. 2, pp. 341–364, 2003
2003
Cited alongside, same era.
A. V. d. Miguel, M. P. Friedlander, F. J. Nogales Martín, and S. Scholtes, “An interior-point method for MPECs based on strictly feasible relaxations.” Department of Decision Sciences, London Business School, Tech. Rep., 2004
2004
Cited alongside, same era.
A. Nemirovski, “Interior point polynomial time methods in convex programming,” Georgia Institute of Technology, Tech. Rep., 2004
2004
Cited alongside, same era.
C. Swamy, “The effectiveness of Stackelberg strategies and tolls for network congestion games,” ACM TALG , vol. 8, no. 4, p. 36, 2012
2012
Later among the works it cites.
R. Vasudevan, V. Shia, Y. Gao, R. Cervera-Navarro, R. Bajcsy, and F. Borrelli, “Safe semi-autonomous control with enhanced driver modeling,” in ACC , 2012, pp. 2896–2903
2012
Later among the works it cites.
S. Dempe and J. Dutta, “Is bilevel programming a special case of a mathematical program with complementarity constraints?” Mathematical programming , vol. 131, no. 1-2, pp. 37–48, 2012
2012
Later among the works it cites.
G. Wachsmuth, “On LICQ and the uniqueness of Lagrange multipliers,” Operations Research Letters , vol. 41, no. 1, pp. 78–80, 2013
2013
Later among the works it cites.
W. Krichene, J. D. Reilly, S. Amin, and A. M. Bayen, “Stackelberg routing on parallel networks with horizontal queues,” IEEE Trans. Automat. Contr. , vol. 59, no. 3, pp. 714–727, 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2005
Cited alongside, same era.
G.-H. Lin and M. Fukushima, “A modified relaxation scheme for mathematical programs with complementarity constraints,” Annals of Operations Research , vol. 133, no. 1-4, pp. 63–84, 2005
2005
Cited alongside, same era.
P. E. Gill, W. Murray, and M. A. Saunders, “SNOPT,” SIAM review , vol. 47, no. 1, pp. 99–131, 2005
2005
Cited alongside, same era.
Y. Sharma and D. P. Williamson, “Stackelberg thresholds in network routing games or the value of altruism,” in ACM conference on Electronic commerce , 2007, pp. 93–102
2007
Cited alongside, same era.
R. T. Rockafellar and R. J.-B. Wets, Variational analysis , 3rd ed. Springer, 2009
2009
Cited alongside, same era.
V. Bonifaci, T. Harks, and G. Schäfer, “Stackelberg routing in arbitrary networks,” Math. Oper. Res. , vol. 35, no. 2, pp. 330–346, 2010
2010
Cited alongside, same era.
S. Steffensen and M. Ulbrich, “A new relaxation scheme for mathematical programs with equilibrium constraints,” SIAM Journal on Optimization , vol. 20, no. 5, pp. 2504–2539, 2010
2010
Cited alongside, same era.
A. Aswani and C. Tomlin, “Game-theoretic routing of GPS-assisted vehicles for energy efficiency,” in ACC , 2011, pp. 3375–3380
2011
Cited alongside, same era.
2014
Later among the works it cites.
D. Bertsimas, V. Gupta, and I. C. Paschalidis, “Data-driven estimation in equilibrium using inverse optimization,” Math Prog , 2014
2014
Later among the works it cites.
C. Kanzow and A. Schwartz, “The price of inexactness: convergence properties of relaxation methods for mathematical programs with complementarity constraints revisited,” Mathematics of Operations Research , vol. 40, no. 2, pp. 253–275, 2014
2014
Later among the works it cites.
G.-H. Lin, M. Xu, and J. Ye, “On solving simple bilevel programs with a nonconvex lower level program,” Mathematical Programming , vol. 144, no. 1-2, pp. 277–305, 2014
2014
Later among the works it cites.
2015
Later among the works it cites.
D. Sadigh, S. Sastry, S. Seshia, and A. Dragan, “Planning for autonomous cars that leverages effects on human actions,” in RSS , 2016
2016
Closest in time.
J. O. Royset and R. J. Wets, “Optimality functions and lopsided convergence,” J Optim Theory Appl , pp. 1–19, 2016
2016
Closest in time.