Global Search for Bilevel Optimization with Quadratic Data

Alexander S. Strekalovsky () and Andrei V. Orlov ()
Additional contact information
Alexander S. Strekalovsky: Matrosov Institute for System Dynamics & Control Theory SB RAS
Andrei V. Orlov: Matrosov Institute for System Dynamics & Control Theory SB RAS

Chapter Chapter 11 in Bilevel Optimization, 2020, pp 313-334 from Springer

Abstract: Abstract This chapter addresses a new methodology for finding optimistic solutions in bilevel optimization problems (BOPs). In Introduction, we present our view of the classification for corresponding numerical methods available in the literature. Then we focus on the quadratic case and describe the reduction of BOPs with quadratic objective functions to one-level nonconvex problems and develop methods of local and global searches for the reduced problems. These methods are based on the new mathematical tools of global search in nonconvex problems: the Global Search Theory (GST). A special attention is paid to a demonstration of the efficiency of the developed methodology for numerical solution of test BOPs.

Keywords: Quadratic bilevel optimization; Optimistic solution; KKT-approach; Penalty approach; Global search theory; Computational experiment (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_11

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

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

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 ().