Výsledky vyhledávání - "Linearly constrained quadratic optimization problems with complementarity constraints"
-
1
A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
ISSN: 0025-5610, 1436-4646Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2016Vydáno v Mathematical programming (01.03.2016)“…We propose an efficient computational method for linearly constrained quadratic optimization problems (QOPs) with complementarity constraints based on their…”
Získat plný text
Journal Article