Pages that link to "Item:Q2704889"
From MaRDI portal
The following pages link to Infeasible interior-point algorithm based optimization method for geometric programming (Q2704889):
Displaying 5 items.
- A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems (Q799488) (← links)
- A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty (Q849071) (← links)
- A primal-dual Newton-type algorithm for geometric programs with equality constraints (Q1062918) (← links)
- An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109) (← links)
- A new algorithm for geometric programming based on the linear structure of its dual problem. (Q1597169) (← links)