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

标题
Generalized Farkas’ lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
作者
关键词
Generalized Farkas’s lemma, Difference of convex optimization, Minimax programs, Duality, Non-convex quadratic optimization, Robust optimization, Convex polynomials
出版物
JOURNAL OF GLOBAL OPTIMIZATION
Volume 64, Issue 4, Pages 679-702
出版商
Springer Nature
发表日期
2015-02-11
DOI
10.1007/s10898-015-0277-4

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

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