Pages that link to "Item:Q280088"
From MaRDI portal
The following pages link to Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization (Q280088):
Displaying 4 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)
- DC approach to weakly convex optimization and nonconvex quadratic optimization problems (Q4639126) (← links)
- Sum-of-squares relaxations in robust DC optimization and feature selection (Q6142071) (← links)
