Abstract
In this article we focus on algorithms for solving simple bilevel programming problems. Simple bilevel problems consist of minimizing a convex function over the solution set of another convex optimization problem. Though the problem is convex the bilevel structure prevents the direct application of the standard methods of convex optimization. Hence several algorithms have been developed in the literature to tackle this problem. In this article we discuss several such algorithms including recent ones.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
A. Beck, S. Sabach, A first order method for finding minimal norm-like solutions of convex optimization problems. Math. Program. 147(1–2), Ser. A, 25–46 (2014)
A. Cabot, Proximal point algorithm controlled by a slowly vanishing term: applications to hierarchical minimization. SIAM J. Optim. 15(2), 555–572 (2004/2005)
S. Dempe, Foundations of Bilevel Programming. (Kluwer Academic Publishers, Dordrecht, 2002)
S. Dempe, J. Dutta, Is bilevel programming a special case of a mathematical program with complementarity constraints? Math. Program. 131(1–2), Ser. A, 37–48 (2012)
S. Dempe, J. Dutta, B.S. Mordukhovich, New necessary optimality conditions in optimistic bilevel programming. Optimization 56(5–6), 577–604 (2007)
S. Dempe, N. Dinh, J. Dutta, Optimality conditions for a simple convex bilevel programming problem, in Variational Analysis and generalized Differentiation in Optimization and Control, ed. by R.S. Burachik, J.-C. Yao (Springer, Berlin, 2010), pp. 149–161
S. Dempe, N. Dinh, J. Dutta, T. Pandit, Simple bilevel programming and extensions. Mathematical Programming (2020). https://doi.org/10.1007/s10107-020-01509-x
S. Dempe, N. Dinh, J. Dutta, T. Pandit, Simple bilevel programming and extensions; Part-II: Algorithms (Preprint 2019). http://arxiv.org/abs/1912.06380
A. Dhara, J. Dutta, Optimality Conditions in Convex Optimization: A Finite-Dimensional View, With a foreword by S. Dempe (CRC Press, Boca Raton, 2012)
J. Dutta, Optimality conditions for bilevel programming: An approach through variational analysis, in Generalized Nash Equilibrium Problems, Bilevel Programming and MPEC. Forumfor Interdisciplinary Mathematics (Springer, Singapore, 2017), pp. 43–64
F. Facchinei, J.-S. Pang, G. Scutari, L. Lampariello, VI constrained hemivariational inequalities: Distributed algorithms and power control in ad-hoc networks. Math. Program. 145, 59–96 (2014)
O. Güler, Foundations of Optimization. Graduate Texts in Mathematics, vol. 258 (Springer, New York, 2010)
E.S. Helou, L.E.A. Simões, ε-subgradient algorithms for bilevel convex optimization. Inverse Probl. 33(5), 055020, 33 pp. (2017)
J.B. Hirriart Urruty, C. Lemarechal, Convex Analysis and Minimization Algorithms. I. Fundamentals. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 305 (Springer, Berlin, 1993)
J. Kelley, The cutting-plane method for solving convex programs, J. Soc. Indust. Appl. Math. 8, 703–712 (1960)
K.C. Kiwiel, Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics, vol. 1133 (Springer, Berlin, 1985)
A.S. Lewis, J.-S. Pang, Error bounds for convex inequality systems, in Generalized Convexity, Generalized Monotonicity: Recent Results (Luminy, 1996). Nonconvex Optimization and Its Applications, vol. 27 (Kluwer Academic Publishers, Dordrecht, 1998), pp. 75–110
T. Pandit, A study of simple bilevel programming and related issues, Ph.D. Thesis, IIT Kanpur, 2019. http://172.28.64.70:8080/jspui/handle/123456789/18699
T. Pandit, J. Dutta, K.S.M. Rao, A new approach to algorithms for Simple Bilevel Programming (SBP), Problem (Preprint 2019)
S. Sabach, S. Shtern, A first order method for solving convex bilevel optimization problems. SIAM J. Optim. 27(2), 640–660 (2017)
Y. Shehu, P.T. Vuong, A. Zemkoho, An inertial extrapolation method for convex simple bilevel optimization. Optim. Method Softw. (2019). https://doi.org/10.1080/10556788.2019.1619729
M.V. Solodov, An explicit descent method for bilevel convex optimization. J. Convex Anal. 14(2), 227–237 (2007)
M.V. Solodov, A bundle method for a class of bilevel nonsmooth convex minimization problems. SIAM J. Optim. 18(1), 242–259 (2007)
N. Yamashita, M. Fukushima, Equivalent unconstrained minimization and global error bounds for variational inequality problems. SIAM J. Control Optim. 35(1), 273–284 (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Dutta, J., Pandit, T. (2020). Algorithms for Simple Bilevel Programming. In: Dempe, S., Zemkoho, A. (eds) Bilevel Optimization. Springer Optimization and Its Applications, vol 161. Springer, Cham. https://doi.org/10.1007/978-3-030-52119-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-52119-6_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-52118-9
Online ISBN: 978-3-030-52119-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)