A new descent algorithm for solving quadratic bilevel programming problems.
type: Item
instance of: scholarly article
title: A new descent algorithm for solving quadratic bilevel programming problems.
zbMATH Open document ID: 1058.90516
DOI: 10.1007/BF02679888
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 2000-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 1517045
zbMATH Keywords: finite descent method
zbMATH Keywords: locally optimal solution
author: Jiye Han
author: Guoshan Liu
author: Shouyang Wang
MaRDI profile type: Publication
cites work: Derivative evaluation and computational experience with large bilevel mathematical programs
cites work: Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
cites work: Q4257417
cites work: A numerical approach to optimization problems with variational inequality constraints
cites work: On bilevel programming. I: General nonlinear cases
cites work: Minimization of Locally Lipschitzian Functions
cites work: Iteration Functions in Some Nonsmooth Optimization Algorithms
cites work: Descent approaches for quadratic bilevel programming
cites work: On a new class of bilevel programming problems and its use for reformulating mixed integer problems
cites work: New Branch-and-Bound Rules for Linear Bilevel Programming
cites work: The Linear-Quadratic Bilevel Programming Problem
cites work: Directional derivatives of the solution of a parametric nonlinear program
description: scientific article; zbMATH DE number 1517045