Pages that link to "Item:Q280088"

The following pages link to Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization (Q280088):

Displaying 2 items.

• D.C. programming approach for solving an applied ore-processing problem (Q1716969) (← links)
• On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)