Pages that link to "Item:Q2572718"

The following pages link to A deterministic global optimization algorithm for generalized geometric programming (Q2572718):

Displaying 28 items.

• A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
• A continuous strategy to solve a class of mixed optimization problems (Q496673) (← links)
• The discrete ellipsoid covering problem: a discrete geometric programming approach (Q496677) (← links)
• Signomial and polynomial optimization via relative entropy and partial dualization (Q823883) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
• A new accelerating method for globally solving a class of nonconvex programming problems (Q923946) (← links)
• A robust algorithm for generalized geometric programming (Q934812) (← links)
• Convexity of products of univariate functions and convexification transformations for geometric programming (Q1014014) (← links)
• A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
• Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
• A global optimization algorithm for signomial geometric programming problem (Q1722230) (← links)
• A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769) (← links)
• An effective algorithm for globally solving quadratic programs using parametric linearization technique (Q1738251) (← links)
• Multi-parametric disaggregation technique for global optimization of polynomial programming problems (Q1941031) (← links)
• A deterministic method for solving the sum of linear ratios problem (Q2004237) (← links)
• A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
• An effective global optimization algorithm for quadratic programs with quadratic constraints (Q2335092) (← links)
• Branch-reduction-bound algorithm for generalized geometric programming (Q2392111) (← links)
• Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs (Q2409582) (← links)
• Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models (Q2424760) (← links)
• A branch and bound algorithm for globally solving a class of nonconvex programming problems (Q2518145) (← links)
• A nonisolated optimal solution for special reverse convex programming problems (Q2519714) (← links)
• Global optimization for generalized geometric programming problems with discrete variables (Q2868905) (← links)
• A Continuous Strategy to Solve a Class of Discrete Optimization Problems (Q2883574) (← links)
• Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
• Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)