Pages that link to "Item:Q2570801"
From MaRDI portal
The following pages link to Level set algorithm for solving convex multiplicative programming problems (Q2570801):
Displaying 4 items.
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (Q2075981) (← links)
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← links)
- A comment on ``Level set algorithm for solving convex multiplicative programming problems'' (Q2378947) (← links)
