On an algorithm solving two-level programming problems with nonunique lower level solutions
From MaRDI portal
Publication:1814990
DOI10.1007/BF00247793zbMath0858.90116MaRDI QIDQ1814990
Publication date: 3 November 1996
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Related Items (13)
Feasible direction method for bilevel programming problem ⋮ Solving ill-posed bilevel programs ⋮ A semivectorial bilevel programming approach to optimize electricity dynamic time-of-use retail pricing ⋮ Bilevel Optimization: Reformulation and First Optimality Conditions ⋮ Softening bilevel problems via two-scale Gibbs measures ⋮ Necessary optimality conditions for bilevel set optimization problems ⋮ Bilevel road pricing: theoretical analysis and optimality conditions ⋮ First-order necessary optimality conditions for general bilevel programming problems ⋮ Gauss-Newton-type methods for bilevel optimization ⋮ Weak via strong Stackelberg problem: New results ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Introduction to sensitivity and stability analysis in nonlinear programming
- Geometric and algorithmic developments for a hierarchical planning problem
- Existence of optimal solutions to mathematical programs with equilibrium constraints
- Convex two-level optimization
- Double penalty method for bilevel optimization problems
- Bilevel and multilevel programming: A bibliography review
- Directional differentiability of optimal solutions under Slater's condition
- Solution point differentiability without strict complementarity in nonlinear programming
- Network design problem with congestion effects: A case of bilevel programming
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- Existence theorems of equilibrium points in stackelberg
- Sensitivity Analysis of Nonlinear Programs and Differentiability Properties of Metric Projections
- On some recent engineering applications of complementarity problems
- Minimization of Locally Lipschitzian Functions
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- A necessary and a sufficient optimality condition for bilevel programming problems
- Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
This page was built for publication: On an algorithm solving two-level programming problems with nonunique lower level solutions
