Pages that link to "Item:Q3396383"
From MaRDI portal
The following pages link to Convex underestimation strategies for signomial functions (Q3396383):
Displayed 21 items.
- Global optimization of signomial geometric programming problems (Q296971) (← links)
- A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- A reformulation framework for global optimization (Q367160) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming (Q1704917) (← links)
- Global optimization of nonconvex problems with convex-transformable intermediates (Q1756773) (← links)
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems (Q1941031) (← links)
- Optimal incentive pricing on relaying services for maximizing connection availability in multihop cellular networks (Q1954655) (← links)
- A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
- Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms (Q2164609) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- Branch-reduction-bound algorithm for generalized geometric programming (Q2392111) (← links)
- Finding multiple optimal solutions of signomial discrete programming problems with free variables (Q2443364) (← links)
- Relaxations of factorable functions with convex-transformable intermediates (Q2452375) (← links)
- Global Optimization of Mixed-Integer Signomial Programming Problems (Q2897303) (← links)
- Efficient Convexification Strategy for Generalized Geometric Programming Problems (Q5138255) (← links)
- Global optimization (Q5896995) (← links)