Pages that link to "Item:Q4149242"
From MaRDI portal
The following pages link to Computational aspects of cutting-plane algorithms for geometric programming problems (Q4149242):
Displaying 5 items.
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm (Q1090621) (← links)
- A cutting-plane algorithm with linear and geometric rates of convergence (Q1147491) (← links)
- Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
- On the computational utility of posynomial geometric programming solution methods (Q3929559) (← links)
- Some remarks on condensation methods for geometric programs (Q4196257) (← links)
