A new descent algorithm for solving quadratic bilevel programming problems.

DOI10.1007/BF02679888zbMATH Open1058.90516MaRDI QIDQ1582569FDOQ1582569

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

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

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)