Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
D.C. versus copositive bounds for standard QP - MaRDI portal

D.C. versus copositive bounds for standard QP (Q2583183)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	D.C. versus copositive bounds for standard QP	scientific article

Statements

scholarly article

0 references

D.C. versus copositive bounds for standard QP (English)

0 references

zbMATH Open document ID

0 references

10.1007/s10898-004-4312-0

0 references

Kurt M. Anstreicher

0 references

0 references

Journal of Global Optimization

0 references

publication date

13 January 2006

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10898-004-4312-0

0 references

0 references

Branch-and-bound approaches to standard quadratic optimization problems

0 references

Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming

0 references

On copositive programming and standard quadratic optimization problems

0 references

Approximation of the Stability Number of a Graph via Copositive Programming

0 references

Maxima for Graphs and a New Proof of a Theorem of Turán

0 references

A comparison of the Delsarte and Lovász bounds

0 references

Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2583183

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2583183&oldid=34474200"