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):
Displaying 37 items.
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
- Geometric programming approach to doping profile design optimization of metal-oxide-semiconductor devices (Q462766) (← links)
- The discrete ellipsoid covering problem: a discrete geometric programming approach (Q496677) (← links)
- A new global optimization algorithm for solving generalized geometric programming (Q624692) (← links)
- A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems (Q799488) (← links)
- Tractable approximate robust geometric programming (Q833439) (← links)
- A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty (Q849071) (← links)
- 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)
- Temperature-aware floorplanning via geometric programming (Q988457) (← links)
- A tutorial on geometric programming (Q1027158) (← links)
- A primal-dual Newton-type algorithm for geometric programs with equality constraints (Q1062918) (← links)
- On subsidiary problems in geometric programming (Q1206603) (← 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)
- A global optimization algorithm for signomial geometric programming problem (Q1722230) (← links)
- Posynomial parametric geometric programming with interval valued coefficient (Q1762404) (← 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)
- Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
- Geometric programming with fuzzy parameters in engineering optimization (Q2379836) (← links)
- Branch-reduction-bound algorithm for generalized geometric programming (Q2392111) (← links)
- Perfect duality in solving geometric programming problems under uncertainty (Q2412848) (← 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)
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation (Q2581486) (← links)
- Infeasible interior-point algorithm based optimization method for geometric programming (Q2704889) (← links)
- Computing Maximum Likelihood Estimators of Convex Density Functions (Q4389265) (← links)
- (Q4545873) (← links)
- Solving geometric programming problems with normal, linear and zigzag uncertainty distributions (Q5890837) (← links)
- Geometric programming problems with triangular and trapezoidal twofold uncertainty distributions (Q6151584) (← links)
- A global interior point method for nonconvex geometric programming (Q6572703) (← links)
