A global interior point method for nonconvex geometric programming

DOI10.1007/S11081-023-09815-XMaRDI QIDQ6572703zbMATH OpenFDO

Authors Roberto Quirino Do Nascimento, Rubia Mara De Oliveira Santos, Nelson Maculan

Publication date 16 July 2024

Published in Optimization and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11081-023-09815-X

zbMATH Keywords

difference of convex functionsgeometric programmingglobal optimizationinterior point method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Interior-point methods (90C51)

Recommendations

• An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming
• A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
• An efficient global approach for posynomial geometric programming problems
• Infeasible interior-point algorithm based optimization method for geometric programming
• Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint

Cites work

• A continuous strategy to solve a class of mixed optimization problems
• A deterministic global optimization algorithm for generalized geometric programming
• A Finsler geometrical programming approach to the nonlinear complementarity problem of traffic equilibrium
• A generalized geometric-programming solution to ``an economic production quantity model with flexibility and reliability considerations
• A new rectangle branch-and-pruning approach for generalized geometric programming
• A non-linear multi-objective technique for hybrid peer-to-peer communication
• A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
• A set of geometric programming test problems and their solutions
• A tutorial on geometric programming
• An infeasible interior-point algorithm for solving primal and dual geometric programs
• Comparison of generalized geometric programming algorithms
• Convex Analysis
• Engineering design by geometric programming
• General variable neighborhood search for the continuous optimization
• Geometric Programming for Communication Systems
• Global optimization of signomial geometric programming problems
• Global solution of optimization problems with signomial parts
• scientific article; zbMATH DE number 3537446 (Why is no real title available?)
• scientific article; zbMATH DE number 3272827 (Why is no real title available?)
• Introduction to global optimization.
• Investigation of path-following algorithms for signomial geometric programming problems
• Linearization method of global optimization for generalized geometric programming
• On the mixed integer signomial programming problems
• Properties of an Interior-Point Mapping for Mixed Complementarity Problems
• Solving geometric programming problems with triangular and trapezoidal uncertainty distributions
• The discrete ellipsoid covering problem: a discrete geometric programming approach

This page was built for publication: A global interior point method for nonconvex geometric programming

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