Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method

Indefinite quadratic programs (QPs) are known to be very difficult to be solved to global optimality, so are linear programs with linear complementarity constraints (LPCCs). It is a classic result that for a QP with an optimal solution, the QP has an equivalent formulation as a certain LPCC in terms...

Full description

Bibliographic Details

Published in:	Mathematical programming computation
Main Authors:	Zhang, Xinyao, Han, Shaoning, Pang, Jong-Shi
Format:	Journal Article
Language:	English
Published:	16.09.2025
ISSN:	1867-2949, 1867-2957
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!