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 8 items.
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
- A finite algorithm for a class of nonlinear multiplicative programs (Q1422889) (← links)
- Level-set methods for convex optimization (Q1739042) (← 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)
- Multiplicative programming and beyond via \(C\)-programming. (Q2776666) (← links)
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs (Q6614694) (← links)