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 analysisnondifferentiable optimizationbilevel programmingeconomic planningnonlinear nonconvex bilevel programming
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52)
Related Items
A Two-Timescale Stochastic Algorithm Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic, An entropic regularization approach for mathematical programs with equilibrium constraints, DC programming techniques for solving a class of nonlinear bilevel programs, A penalty method with trust-region mechanism for nonlinear bilevel optimization problem, Linearly convergent bilevel optimization with single-step inner methods, Solving quadratic convex bilevel programming problems using a smoothing method, Solving linear fractional bilevel programs., Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm, A cooperative coevolution PSO technique for complex bilevel programming problems and application to watershed water trading decision making problems, Feature selection for classification models via bilevel optimization, A novel approach to bilevel nonlinear programming, On structural safety assessment by load factor maximization in piecewise linear plasticity, An overview of bilevel optimization, On applied nonlinear and bilevel programming for pursuit-evasion games, A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints, A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience, A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints, Parameter identification of quasibrittle materials as a mathematical program with equilibrium constraints, Exact penalty functions for convex bilevel programming problems., Reformulations in Mathematical Programming: Definitions and Systematics, Global solution of bilevel programs with a nonconvex inner program, Some results on mathematical programs with equilibrium constraints, A bilevel programming approach to determining tax credits for biofuel production, A new descent algorithm for solving quadratic bilevel programming problems., On generalized semi-infinite optimization and bilevel optimization, BOLIB: Bilevel Optimization LIBrary of Test Problems, 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
- 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
- Optimization and nonsmooth analysis
- 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
