Pages that link to "Item:Q865546"

The following pages link to A new rectangle branch-and-pruning approach for generalized geometric programming (Q865546):

Displaying 21 items.

• Range division and contraction algorithm for a class of global optimization problems (Q279507) (← 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 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)
• 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 global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645) (← 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)
• Using conical partition to globally maximizing the nonlinear sum of ratios (Q1957316) (← links)
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← 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)
• 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)
• An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)