A new descent algorithm for solving quadratic bilevel programming problems.

DOI10.1007/BF02679888zbMath1058.90516MaRDI QIDQ1582569

Ji-ye Han, Shou-Yang Wang, Guo-shan Liu

Publication date: 2000

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

locally optimal solutionfinite descent method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (1)

Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Derivative evaluation and computational experience with large bilevel mathematical programs
• Descent approaches for quadratic bilevel programming
• On a new class of bilevel programming problems and its use for reformulating mixed integer problems
• A numerical approach to optimization problems with variational inequality constraints
• On bilevel programming. I: General nonlinear cases
• Directional derivatives of the solution of a parametric nonlinear program
• Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
• Minimization of Locally Lipschitzian Functions
• New Branch-and-Bound Rules for Linear Bilevel Programming
• The Linear-Quadratic Bilevel Programming Problem
• Iteration Functions in Some Nonsmooth Optimization Algorithms
• Unnamed Item

This page was built for publication: A new descent algorithm for solving quadratic bilevel programming problems.