A trust region algorithm for nonlinear bilevel programming
type: Item
instance of: scholarly article
title: A trust region algorithm for nonlinear bilevel programming
zbMATH Open document ID: 0993.90071
DOI: 10.1016/S0167-6377(01)00092-X
author: P. Marcotte
author: Gilles Savard
author: Daoli Zhu
published in: Operations Research Letters
publication date: 2002-07-03T00:00:00Z
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1762704
zbMATH Keywords: generalized bilevel programs
zbMATH Keywords: trust region
zbMATH Keywords: linesearch
MaRDI profile type: Publication
cites work: Q4000274
cites work: Sensitivity Analysis in Variational Inequalities
cites work: An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints
cites work: New Branch-and-Bound Rules for Linear Bilevel Programming
cites work: Exact and inexact penalty methods for the generalized bilevel programming problem
cites work: Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
cites work: Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets
cites work: Some continuity properties of polyhedral multifunctions
cites work: Exact Penalization of Mathematical Programs with Equilibrium Constraints
full work available at URL: s0167-6377(01)00092-x
OpenAlex ID: W2116765717
description: scientific article; zbMATH DE number 1762704