A new global optimization approach for convex multiplicative programming

DOI10.1016/J.AMC.2010.02.012MaRDI QIDQ972168zbMATH OpenOpenAlexFDO

Authors Yuelin Gao, Guo-rong Wu, Weimin 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

branch-and-boundconvex multiplicative programmingglobal optimizationnumerical resultsoutcome spaceouter approximationquasiconcave programming

Mathematics Subject Classification ID

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

Recommendations

• A global optimization approach for solving the convex multiplicative programming problem
• A global optimization for a class of multiplicative programming problems
• Global Optimization of Convex Multiplicative Programs by Duality Theory
• A convex analysis approach for convex multiplicative programming
• Global optimization for generalized linear multiplicative programming using convex relaxation

Cites work

• A convex envelope formula for multilinear functions
• A global optimization approach for solving the convex multiplicative programming problem
• A parametric successive underestimation method for convex multiplicative programming problems
• An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
• An outcome-space finite algorithm for solving linear multiplicative programming
• An outer approximation method for minimizing the product of several convex functions on a convex set
• Generalized convex multiplicative programming via quasiconcave minimization
• Generalized linear multiplicative and fractional programming
• Global minimization of a generalized convex multiplicative function
• scientific article; zbMATH DE number 3356443 (Why is no real title available?)
• Introduction to global optimization
• Solving Bicriterion Mathematical Programs

Cited in

(27)

• A global optimization approach for solving the convex multiplicative programming problem
• A parametric successive underestimation method for convex multiplicative programming problems
• An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
• Global optimization for generalized linear multiplicative programming using convex relaxation
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
• An objective space cut and bound algorithm for convex multiplicative programmes
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
• An outcome space branch-and-bound algorithm for a class of linear multiplicative programming problems
• scientific article; zbMATH DE number 1799337 (Why is no real title available?)
• Global optimization for D.C. multiplicative programming
• Global optimization algorithm for solving linear multiplicative programming problems
• Global Optimization of Convex Multiplicative Programs by Duality Theory
• A new “Optimization‐Preserving‐Operator” applied to global optimization
• An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
• An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation
• Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs
• A method based on parametric convex programming for solving convex multiplicative programming problem
• A new branch-and-bound algorithm for generalized affine multiplicative programming
• An efficient outcome-space branch-and-bound algorithm for solving a class of large-scale linear multiplicative programs
• A branch-reduction-bound algorithm for linear fractional multi-product planning problems
• A new branch and bound method for solving linear multiplicative programming problems
• Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs
• Output-space branch-and-bound algorithm adopting an adaptive branching rule for solving general linear fractional-multiplicative programs
• Globally minimizing a class of linear multiplicative programming under the flexible branching scheme
• An accelerating algorithm for globally solving nonconvex quadratic programming
• An efficient algorithm for globally solving generalized linear multiplicative programming
• A convex analysis approach for convex multiplicative programming

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

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