Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax Programs

Published 2013 View Full Article

Authors

Keywords

Sum-of-squares convex polynomials, Minimax programming, Semidefinite programming, Duality, Zero duality gap

Journal

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS

Volume 162, Issue 3, Pages 735-753

Publisher

Springer Nature

Online

2013-12-05

DOI

10.1007/s10957-013-0496-0

References

View 6 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started