A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

We propose an efficient computational method for linearly constrained quadratic optimization problems (QOPs) with complementarity constraints based on their Lagrangian and doubly nonnegative (DNN) relaxation and first-order algorithms. The simplified Lagrangian–completely positive programming (CPP)...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 156; číslo 1-2; s. 161 - 187
Hlavní autoři:	Kim, Sunyoung, Kojima, Masakazu, Toh, Kim-Chuan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2016 Springer Nature B.V
Témata:	Algorithms Approximation Assignment problem Calculus of Variations and Optimal Control; Optimization Combinatorics Computation Computer programming Conics Equivalence Full Length Paper Knapsack problem Lower bounds Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematical models Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Optimization techniques Programming Studies Theoretical Variables United States > US 90C20 The Lagrangian–conic relaxation Iterative solver 90C25 Bisection method 90C26 Linearly constrained quadratic optimization problems with complementarity constraints
ISSN:	0025-5610, 1436-4646
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!