Pages that link to "Item:Q2655346"

The following pages link to Convex relaxation for solving posynomial programs (Q2655346):

Displaying 12 items.

• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
• Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← 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)
• 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)
• Branch-reduction-bound algorithm for generalized geometric programming (Q2392111) (← links)
• Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms (Q2397434) (← links)
• Relaxations of factorable functions with convex-transformable intermediates (Q2452375) (← links)
• Global Optimization of Mixed-Integer Signomial Programming Problems (Q2897303) (← links)
• A parsimonious model for generating arbitrage-free scenario trees (Q5001123) (← links)
• Efficient Convexification Strategy for Generalized Geometric Programming Problems (Q5138255) (← links)