Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995): Difference between revisions

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

zbMATH Keywords

sum-of-squares convex polynomials

0 references

minimax programming

0 references

semidefinite programming

0 references

duality

0 references

zero duality gap

0 references

reviewed by

Xiangsun Zhang

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q4286721

0 references

Min-max optimization of several classical discrete optimization problems

0 references

Q3182207

0 references

Theory and Applications of Robust Optimization

0 references

Strong Duality in Robust Convex Programming: Complete Characterizations

0 references

Q4779970

0 references

Exact SDP relaxations for classes of nonlinear semidefinite programming problems

0 references

Semidefinite Programming

0 references

Semidefinite representation of convex sets

0 references

A convex polynomial that is not sos-convex

0 references

A Complete Characterization of the Gap between Convexity and SOS-Convexity

0 references

Q3601990

0 references

A Frank--Wolfe type theorem for convex polynomial programs

0 references

Q3149262

0 references

Lectures on Modern Convex Optimization

0 references

Farkas-type results for max-functions and applications

0 references

Q3141900

0 references

Q3996569

0 references

An algorithm for generalized fractional programs

0 references

Duality without a constraint qualification for minimax fractional programming

0 references

Fractional programming

0 references

Identifiers

zbMATH Open document ID

1312.90087

0 references

DOI

10.1007/s10957-013-0496-0

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:462995

@@ Property / author @@
-José Vicente-Pérez
@@ Property / author: José Vicente-Pérez / rank @@
-Normal rank
@@ Property / author @@
+José Vicente-Pérez
@@ Property / author: José Vicente-Pérez / rank @@
+Normal rank
@@ Property / review text @@
+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.
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C47
@@ Property / Mathematics Subject Classification ID: 90C47 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C22
@@ Property / Mathematics Subject Classification ID: 90C22 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C46
@@ Property / Mathematics Subject Classification ID: 90C46 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6360646
@@ Property / zbMATH DE Number: 6360646 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+sum-of-squares convex polynomials
@@ Property / zbMATH Keywords: sum-of-squares convex polynomials / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimax programming
@@ Property / zbMATH Keywords: minimax programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+semidefinite programming
@@ Property / zbMATH Keywords: semidefinite programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+duality
@@ Property / zbMATH Keywords: duality / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+zero duality gap
@@ Property / zbMATH Keywords: zero duality gap / rank @@
+Normal rank
@@ Property / reviewed by @@
+Xiangsun Zhang
@@ Property / reviewed by: Xiangsun Zhang / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1993400404
@@ Property / OpenAlex ID: W1993400404 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.5151
@@ Property / arXiv ID: 1307.5151 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4286721
@@ Property / cites work: Q4286721 / rank @@
+Normal rank
@@ Property / cites work @@
+Min-max optimization of several classical discrete optimization problems
+Normal rank
@@ Property / cites work @@
+Q3182207
@@ Property / cites work: Q3182207 / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Robust Optimization
@@ Property / cites work: Theory and Applications of Robust Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Strong Duality in Robust Convex Programming: Complete Characterizations
+Normal rank
@@ Property / cites work @@
+Q4779970
@@ Property / cites work: Q4779970 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact SDP relaxations for classes of nonlinear semidefinite programming problems
+Normal rank
@@ Property / cites work @@
+Semidefinite Programming
@@ Property / cites work: Semidefinite Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite representation of convex sets
@@ Property / cites work: Semidefinite representation of convex sets / rank @@
+Normal rank
@@ Property / cites work @@
+A convex polynomial that is not sos-convex
@@ Property / cites work: A convex polynomial that is not sos-convex / rank @@
+Normal rank
@@ Property / cites work @@
+A Complete Characterization of the Gap between Convexity and SOS-Convexity
+Normal rank
@@ Property / cites work @@
+Q3601990
@@ Property / cites work: Q3601990 / rank @@
+Normal rank
@@ Property / cites work @@
+A Frank--Wolfe type theorem for convex polynomial programs
+Normal rank
@@ Property / cites work @@
+Q3149262
@@ Property / cites work: Q3149262 / rank @@
+Normal rank
@@ Property / cites work @@
+Lectures on Modern Convex Optimization
@@ Property / cites work: Lectures on Modern Convex Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Farkas-type results for max-functions and applications
+Normal rank
@@ Property / cites work @@
+Q3141900
@@ Property / cites work: Q3141900 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3996569
@@ Property / cites work: Q3996569 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for generalized fractional programs
@@ Property / cites work: An algorithm for generalized fractional programs / rank @@
+Normal rank
@@ Property / cites work @@
+Duality without a constraint qualification for minimax fractional programming
+Normal rank
@@ Property / cites work @@
+Fractional programming
@@ Property / cites work: Fractional programming / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:462995