Sum-of-squares relaxations for polynomial min–max problems over simple sets
We consider min–max optimization problems for polynomial functions, where a multivariate polynomial is maximized with respect to a subset of variables, and the resulting maximal value is minimized with respect to the remaining variables. When the variables belong to simple sets (e.g., a hypercube, t...
Saved in:
| Published in: | Mathematical programming Vol. 209; no. 1; pp. 475 - 501 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.01.2025
|
| Subjects: | |
| ISSN: | 0025-5610, 1436-4646 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!