Global optimization in generalized geometric programming

Keyphrases

• Global Minimum 100%
• Convex Relaxation 100%
• Global Optimization 100%
• Generalized Geometric Programming 100%
• Lower Bounding 100%
• Signomial 100%
• Generalized Geometry 100%
• Tight 50%
• Global Optimization Algorithm 50%
• Number of Tests 50%
• Branch-and-bound 50%
• Convex Optimization Problem 50%
• Problem Analysis 50%
• Inequality Constraints 50%
• Nonlinear Convex Optimization 50%
• Successive Refinement 50%
• Difference of Two Convex Functions 50%
• Exponential Random Variables 50%
• Variable Transformation 50%
• Feasible Region 50%
• Finite Convergence 50%
• Nonconvex Problem 50%
• Bound Variables 50%
• Deterministic Global Optimization 50%
• Monotonicity Analysis 50%
• Convex Minimization 50%
• DC Programming Problem 50%
• Variable Bounds 50%
• Robust Stability Analysis 50%

Mathematics

• Objective Function 100%
• Geometric Programming 100%
• Bound Variable 100%
• Stability Analysis 50%
• Convex Function 50%
• Inequality Constraint 50%
• Programming Problem 50%
• Feasible Region 50%
• Nonconvex Problem 50%
• Convex Minimization 50%

Engineering

• Objective Function 100%
• Stability Analysis 50%
• Convex Function 50%
• Robust Stability 50%
• Feasible Region 50%
• Convex Optimization Problem 50%
• Analysis Problem 50%
• Inequality Constraint 50%