Pages that link to "Item:Q2576450"
From MaRDI portal
The following pages link to Robust solution of nonconvex global optimization problems (Q2576450):
Displayed 7 items.
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem (Q427361) (← links)
- Global optimization for the generalized polynomial sum of ratios problem (Q548182) (← links)
- A robust algorithm for generalized geometric programming (Q934812) (← links)
- Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint (Q987514) (← links)
- \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization (Q989898) (← links)
- A robust algorithm for quadratic optimization under quadratic constraints (Q2385494) (← links)
- Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set (Q2518117) (← links)