An efficient convexification method for solving generalized geometric problems

DOI10.3934/JIMO.2012.8.429MaRDI QIDQ2358874zbMATH OpenOpenAlexFDO

Authors Hao-Chun Lu

Publication date 16 June 2017

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/jimo.2012.8.429

zbMATH Keywords

1-convex functionconvex underestimatorconvexificationgeometric programmingpower convex transformation

Mathematics Subject Classification ID

Optimality conditions for free problems in two or more independent variables (49K10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Minimax problems in mathematical programming (90C47)

Recommendations

• Global optimization of signomial geometric programming problems
• An efficient global approach for posynomial geometric programming problems
• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
• Global optimization for generalized geometric programs with mixed free-sign variables
• A convexification method for a class of global optimization problems with applications to reliability optimization

Cites work

• A geometric programming framework for univariate cubic L₁ smoothing splines
• A superior representation method for piecewise linear functions
• Approximating separable nonlinear functions via mixed zero-one programs
• Complementary Geometric Programming
• Constrained maximization of posynomials by geometric programming
• Deterministic global optimization. Theory, methods and applications
• Digital Circuit Optimization via Geometric Programming
• Duality Theory for Geometric Programming
• Generalized Polynomial Optimization
• Generalized Weighted Mean Programming
• Geometric Programming for Communication Systems
• Geometric programming with signomials
• Geometric Programming: Methods, Computations and Applications
• Global optimization for generalized geometric programs with mixed free-sign variables
• Global solution of optimization problems with signomial parts
• Handbook of test problems in local and global optimization
• scientific article; zbMATH DE number 976325 (Why is no real title available?)
• Linearizing Geometric Programs
• On the Solution of Geometric Programs via Separable Programming
• Piece-wise linear approximation of functions of two variables
• Treating free variables in generalized geometric global optimization programs

Cited in

(8)

• A general algorithm for determining all essential solutions and inequalities for any convex polyhedron
• Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
• Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms
• A MILP formulation for generalized geometric programming using piecewise-linear approximations
• scientific article; zbMATH DE number 3874995 (Why is no real title available?)
• Finding all global optima of engineering design problems with discrete signomial terms
• Efficient Convexification Strategy for Generalized Geometric Programming Problems

Describes a project that uses

Uses Software

• LINGO
• LINDO

This page was built for publication: An efficient convexification method for solving generalized geometric problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2358874)