Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization (Q280088): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-015-0277-4 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-015-0277-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973524432 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q124842567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Frank--Wolfe type theorem for convex polynomial programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new Farkas-type results for inequality systems with DC functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A closedness condition and its applications to DC programs with convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3515805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farkas' lemma: three decades of generalizations for mathematical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange-type duality in DC programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC programming: overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete characterizations of stable Farkas' lemma and cone-convex programming duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of alternative theorems for SOS-convex inequalities and robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual semidefinite programs without duality gaps for a class of convex minimax programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in D. C. programming: The case of several D. C. constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculus Without Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of the S-Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3149262 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-015-0277-4 / rank
 
Normal rank

Latest revision as of 13:21, 9 December 2024

scientific article
Language Label Description Also known as
English
Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
scientific article

    Statements

    Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization (English)
    0 references
    0 references
    0 references
    29 April 2016
    0 references
    In this paper, motivated by robust (non-convex) quadratic optimization over convex quadratic constraints, a minimax difference of convex (dc) optimization over convex polynomial inequalities is examined. Using a generalization of the celebrated Farkas lemma to inequality systems involving the maximum of dc functions and convex polynomials, it is shown that there is no duality gap between a minimax DC polynomial program and its associated conjugate dual problem. Then strong duality under a constraint qualification is obtained. Consequently, characterizations of robust solutions of uncertain general non-convex quadratic optimization problems with convex quadratic constraints, including uncertain trust-region problems are presented.
    0 references
    generalized Farkas's lemma
    0 references
    difference of convex optimization
    0 references
    minimax programs
    0 references
    duality
    0 references
    non-convex quadratic optimization
    0 references
    robust optimization
    0 references
    convex polynomials
    0 references

    Identifiers