Generalized Farkas’ lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization

Title
Generalized Farkas’ lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
Authors
Keywords
Generalized Farkas’s lemma, Difference of convex optimization, Minimax programs, Duality, Non-convex quadratic optimization, Robust optimization, Convex polynomials
Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 64, Issue 4, Pages 679-702
Publisher
Springer Nature
Online
2015-02-11
DOI
10.1007/s10898-015-0277-4

Ask authors/readers for more resources

Reprint

Contact the author

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

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