Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993400404 / rank | |||
Normal rank | |||
Revision as of 21:55, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dual semidefinite programs without duality gaps for a class of convex minimax programs |
scientific article |
Statements
Dual semidefinite programs without duality gaps for a class of convex minimax programs (English)
0 references
23 October 2014
0 references
The authors introduce a new dual program, which is representable as a semidefinite linear programming problem, for a primal convex minimax programming problem. They show that there is no duality gap between the primal and the dual whenever the functions involved are sum-of-squares convex polynomials. The strong duality results for this class of minimax problems are derived under a suitable constraint qualification.
0 references
sum-of-squares convex polynomials
0 references
minimax programming
0 references
semidefinite programming
0 references
duality
0 references
zero duality gap
0 references
