Bilevel and multilevel programming: A bibliography review

By Luís Nunes Vicente, P. Calamai. 1994

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

The Ideal Continual Learner: An Agent That Never Forgets (2023, methodology): “Note that relation (33) was discussed by Tsakiris & Vidal (2018) in a different context, in comparison to the algorithm of Lerman et al.”
Coresets via Bilevel Optimization for Continual Learning and Streaming (2020, background): “Modeling hierarchical decision making processes [54], bilevel optimization has witnessed an increasing popularity in machine learning recently, with applications ranging from meta-learning [20], to hyperparameter optimization [45, 21] and neural architecture search [37].”
A Practical Optimality Condition Without Constraint Qualifications for Nonlinear Programming (2003, unknown): “See [8, 9, 25] and references therein.”
Complete search in continuous global optimization and constraint satisfaction (2004, background): “, [28, 203, 259, 299, 331], in which the inner optimization problem is a linear program.”
Traffic Morphing: An Efficient Defense Against Statistical Traffic Analysis (2009, methodology): “In doing so, we trade off the global optimality of our technique by finding the morphing matrices for subspaces of the large space independently of one another, rather than finding a single global morphing matrix.”
Weak linear bilevel programming problems : Existence of solutions via a penalty method (2005, background): “The reader is also referred to the annotated bibliography on bileve mization given in [6,7].”
Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints (2003, methodology): “This results in vertex enumeration methods [Campelo and Scheimberg, 2000], [Candler and Townsley, 1982], [Önal, 1993] and in the complementary pivoting algorithm for the linear bilevel problems [Júdice and Faustino, 1988], [Júdice and Faustino, 1992] and for problems with quadratic lower level probl”
A bilevel optimization approach to automated parameter tuning (2014, background): “Since then a number of studies have been conducted on bilevel programming [8, 41, 13].”
An overview of bilevel optimization (2007, background): “Hence more general surveys appeared, such as those by Savard (1989), Anandalingam and Friesz (1992) and Vicente and Calamai (1994).”
MULTI-LEADER-FOLLOWER GAMES: MODELS, METHODS AND APPLICATIONS (2015, background): “As a bilevel program [72], the Stackelberg game can be looked on as a special case of the mathematical program with equilibrium constraints (MPEC for short), when one replaces the followers’ problems by their optimality conditions.”
Sparse Feature Attacks in Adversarial Learning (2014, background): “3) The problem as stated above is an example of a bi-level optimization [20] because the constraint is a separate (but coupled) optimization problem in its own right.”
A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications (2017, background): “At this point, we would like to refer the readers to other review papers [49], [57], [90], [150], [164] and books [18], [60], [61], [140], [159] on bilevel optimization.”