A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs |
scientific article; zbMATH DE number 7139386
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs |
scientific article; zbMATH DE number 7139386 |
Statements
A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (English)
0 references
3 December 2019
0 references
nonconvex polynomial optimization
0 references
conic programming relaxations
0 references
global optimization
0 references
cone-convex polynomial programs
0 references
convex semi-algebraic programs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
