On bilevel programming. I: General nonlinear cases
type: Item
instance of: scholarly article
title: On bilevel programming. I: General nonlinear cases
zbMATH Open document ID: 0841.90112
DOI: 10.1007/BF01585928
author: James E. Falk
author: Jiming Liu
published in: Mathematical Programming. Series A. Series B
publication date: 1996-07-29T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 829918
zbMATH Keywords: bilevel programming
zbMATH Keywords: nondifferentiable optimization
zbMATH Keywords: economic planning
zbMATH Keywords: sensitivity analysis
zbMATH Keywords: nonlinear nonconvex bilevel programming
MaRDI profile type: Publication
cites work: Hierarchical optimization: An introduction
cites work: Optimality conditions for the bilevel programming problem
cites work: An Algorithm for Solving the General Bilevel Programming Problem
cites work: On two-level optimization
cites work: Optimization and nonsmooth analysis
cites work: Implicitly defined optimization problems
cites work: On the stable global convergence of particular quasi-newton-methods
cites work: Introduction to sensitivity and stability analysis in nonlinear programming
cites work: Degeneracy in NLP and the development of results motivated by its presence
cites work: Q4226179
cites work: A Representation and Economic Interpretation of a Two-Level Programming Problem
cites work: Lipschitz Continuity for Constrained Processes
cites work: Double penalty method for bilevel optimization problems
cites work: Second-order sensitivity analysis in factorable programming: Theory and applications
cites work: Solution point differentiability without strict complementarity in nonlinear programming
cites work: Methods of descent for nondifferentiable optimization
cites work: Derivative evaluation and computational experience with large bilevel mathematical programs
cites work: Sensitivity Analysis in Nonlinear Programs and Variational Inequalities via Continuous Selections
cites work: Q3813630
cites work: Semismooth and Semiconvex Functions in Constrained Optimization
cites work: Solution differentiability and continuation of Newton's method for variational inequality problems over polyhedral sets
cites work: Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
cites work: Strongly Regular Generalized Equations
cites work: Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
cites work: Normal Maps Induced by Linear Transformations
cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
cites work: A new computational method for Stackelberg and min-max problems by use of a penalty method
description: scientific article; zbMATH DE number 829918