Algorithms for Simple Bilevel Programming

Joydeep Dutta () and Tanushree Pandit ()
Additional contact information
Joydeep Dutta: Indian Institute of Technology Kanpur
Tanushree Pandit: Indian Institute of Technology Kanpur

Chapter Chapter 9 in Bilevel Optimization, 2020, pp 253-291 from Springer

Abstract: 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.

Keywords: Bilevel programming problems; Convex optimization; Projected gradient method; Gradient Lipschitz condition; Proximal point method; Convex functions; Strongly convex functions (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-52119-6_9

Ordering information: This item can be ordered from
http://www.springer.com/9783030521196

DOI: 10.1007/978-3-030-52119-6_9

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().