Pages that link to "Item:Q1361109"
From MaRDI portal
The following pages link to An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109):
Displayed 14 items.
- On generalized geometric programming problems with non-positive variables (Q857357) (← links)
- A new rectangle branch-and-pruning approach for generalized geometric programming (Q865546) (← links)
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation (Q879567) (← links)
- Utility based option pricing with proportional transaction costs and diversification problems: An interior-point optimization approach (Q1294549) (← links)
- Global optimization of signomial geometric programming using linear relaxation. (Q1428180) (← links)
- Linearization method of global optimization for generalized geometric programming (Q1763283) (← links)
- ``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods (Q1771312) (← links)
- Global optimization of generalized geometric programming (Q1779583) (← links)
- A global optimization using linear relaxation for generalized geometric programming (Q2427180) (← links)
- Posynomial geometric programming with interval exponents and coefficients (Q2462103) (← links)
- Accelerating method of global optimization for signomial geometric programming (Q2479370) (← links)
- Posynomial geometric programming with parametric uncertainty (Q2569031) (← links)
- A deterministic global optimization algorithm for generalized geometric programming (Q2572718) (← links)
- Computing Maximum Likelihood Estimators of Convex Density Functions (Q4389265) (← links)