A new global optimization approach for convex multiplicative programming

DOI10.1016/j.amc.2010.02.012zbMath1191.65069OpenAlexW1976799446MaRDI QIDQ972168

Yuelin Gao, Guo-rong Wu, Wei-Min Ma

Publication date: 25 May 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.02.012

zbMATH Keywords

global optimizationnumerical resultsbranch-and-boundouter approximationoutcome spaceconvex multiplicative programmingquasiconcave programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

An accelerating algorithm for globally solving nonconvex quadratic programming ⋮ Global optimization algorithm for solving linear multiplicative programming problems ⋮ An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems ⋮ An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming ⋮ An efficient algorithm for globally solving generalized linear multiplicative programming ⋮ An objective space cut and bound algorithm for convex multiplicative programmes ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints

Cites Work

• Unnamed Item
• An outer approximation method for minimizing the product of several convex functions on a convex set
• An outcome-space finite algorithm for solving linear multiplicative programming
• A global optimization approach for solving the convex multiplicative programming problem
• A parametric successive underestimation method for convex multiplicative programming problems
• Global minimization of a generalized convex multiplicative function
• Generalized convex multiplicative programming via quasiconcave minimization
• A convex envelope formula for multilinear functions
• An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
• Introduction to global optimization
• Generalized linear multiplicative and fractional programming
• Solving Bicriterion Mathematical Programs

This page was built for publication: A new global optimization approach for convex multiplicative programming