On bilevel programming. I: General nonlinear cases
From MaRDI portal
Publication:1904659
DOI10.1007/BF01585928zbMath0841.90112MaRDI QIDQ1904659
Publication date: 29 July 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
sensitivity analysis; nondifferentiable optimization; bilevel programming; economic planning; nonlinear nonconvex bilevel programming
90C26: Nonconvex programming, global optimization
90C30: Nonlinear programming
90C31: Sensitivity, stability, parametric optimization
49J52: Nonsmooth analysis
Related Items
A bilevel programming approach to determining tax credits for biofuel production, A new descent algorithm for solving quadratic bilevel programming problems.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Introduction to sensitivity and stability analysis in nonlinear programming
- Second-order sensitivity analysis in factorable programming: Theory and applications
- Derivative evaluation and computational experience with large bilevel mathematical programs
- Hierarchical optimization: An introduction
- Double penalty method for bilevel optimization problems
- Implicitly defined optimization problems
- Degeneracy in NLP and the development of results motivated by its presence
- Solution differentiability and continuation of Newton's method for variational inequality problems over polyhedral sets
- Methods of descent for nondifferentiable optimization
- Optimality conditions for the bilevel programming problem
- An Algorithm for Solving the General Bilevel Programming Problem
- Solution point differentiability without strict complementarity in nonlinear programming
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- Lipschitz Continuity for Constrained Processes
- Strongly Regular Generalized Equations
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- A new computational method for Stackelberg and min-max problems by use of a penalty method
- On two-level optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Normal Maps Induced by Linear Transformations
- Semismooth and Semiconvex Functions in Constrained Optimization
- On the stable global convergence of particular quasi-newton-methods
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Sensitivity Analysis in Nonlinear Programs and Variational Inequalities via Continuous Selections
- Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
