A new descent algorithm for solving quadratic bilevel programming problems.

DOI10.1007/BF02679888MaRDI QIDQ1582569zbMATH OpenFDO

Authors Jiye Han, Guoshan Liu, Shouyang Wang

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) Quadratic programming (90C20) Nonconvex programming, global optimization (90C26)

Cites work

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

Cited in

(1)

• Bilevel optimization: theory, algorithms, applications and a bibliography

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582569)