A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions
From MaRDI portal
Publication:1567480
DOI10.1023/A:1008735010803zbMath0947.90110MaRDI QIDQ1567480
Publication date: 30 October 2000
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Bilevel programming for generating discrete representations in multiobjective optimization ⋮ Solving ill-posed bilevel programs ⋮ Bilevel Optimization: Reformulation and First Optimality Conditions ⋮ A DC Algorithm for Solving Quadratic-linear Bilevel Optimization Problems ⋮ Optimality Conditions for a Simple Convex Bilevel Programming Problem ⋮ Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development ⋮ Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results ⋮ On the computation of relaxed pessimistic solutions to MPECs ⋮ Gauss-Newton-type methods for bilevel optimization ⋮ Deregulated electricity markets with thermal losses and production bounds: models and optimality conditions ⋮ Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Bundle trust-region algorithm for bilinear bilevel programming
