Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for spectrahedron with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2009 (1) 2012 (1) 2016 (2)
Publication types (Num. hits)
article(1) inproceedings(3)
Venues (Conferences, Journals, ...)
CoRR(1) ESA(1) ISSAC(1) NIPS(1)
Authors
Dan Garber(2) Joachim Giesen(1) Markus Schweighofer(1) Martin Jaggi(1) Sören Laue(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5 occurrences of 5 keywords
Results
Found 4 publication records. Showing 4 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
69Markus Schweighofer Describing convex semialgebraic sets by linear matrix inequalities. Search on Bibsonomy ISSAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF determinantal representation, moment relaxation, polynomial inequality, quadratic module, semialgebraic set, spectrahedron, semidefinite programming, linear matrix inequality, convex set, sums of squares, preordering
40Dan Garber Faster Projection-free Convex Optimization over the Spectrahedron. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
40Dan Garber Faster Projection-free Convex Optimization over the Spectrahedron. Search on Bibsonomy NIPS The full citation details ... 2016 DBLP  BibTeX  RDF
40Joachim Giesen, Martin Jaggi, Sören Laue Optimizing over the Growing Spectrahedron. Search on Bibsonomy ESA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #4 of 4 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license