A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
type: Item
instance of: scholarly article
title: A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
zbMATH Open document ID: 1005.65059
DOI: 10.1016/S0377-0427(02)00419-3
published in: Journal of Computational and Applied Mathematics
publication date: 2002-09-17T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1801719
zbMATH Keywords: quadratic program
zbMATH Keywords: linear complementarity constraints
zbMATH Keywords: branch-and-bound algorithm
zbMATH Keywords: extreme point algorithm
zbMATH Keywords: globally
zbMATH Keywords: local search method
zbMATH Keywords: numerical experiment
author: Guoshan Liu
author: Jianzhong Zhang
MaRDI profile type: Publication
cites work: Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
cites work: Convex two-level optimization
cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem
cites work: A simple algorithm for the-linear bilevel programming problem
cites work: Q4257417
cites work: A smoothing method for mathematical programs with equilibrium constraints
cites work: On bilevel programming. I: General nonlinear cases
cites work: Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
cites work: A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
cites work: New Branch-and-Bound Rules for Linear Bilevel Programming
cites work: The Linear-Quadratic Bilevel Programming Problem
cites work: Derivative evaluation and computational experience with large bilevel mathematical programs
cites work: Heuristic algorithms for delivered price spatially competitive network facility location problems
cites work: A numerical approach to optimization problems with variational inequality constraints
cites work: Minimization of Locally Lipschitzian Functions
cites work: Q4215008
cites work: Exact Penalization of Mathematical Programs with Equilibrium Constraints
cites work: A global optimization approach for the linear two-level program
cites work: Bilevel and multilevel programming: A bibliography review
cites work: Descent approaches for quadratic bilevel programming
cites work: A new extreme point algorithm and its application in PSQP algorithms for solving mathematical programs with linear complementarity constraints.
description: scientific article; zbMATH DE number 1801719