A parametric successive underestimation method for convex multiplicative programming problems

DOI10.1007/BF00119935zbMath0752.90057MaRDI QIDQ1200637

Takahito Kuno, Hiroshi Konno

Publication date: 16 January 1993

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundglobal minimumnonconvex problemconvex multiplicative functionproduct of two nonnegative convex functionssequence of convex programming problemsunderestimating function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Linear programs with an additional rank two reverse convex constraint, Branch-and-bound decomposition approach for solving quasiconvex-concave programs, Convex programs with an additional constraint on the product of several convex functions, A fifth bibliography of fractional programming^*, On jet-convex functions and their tensor products, Multiplicative programming problems: Analysis and efficient point search heuristic, A branch-and-reduce approach to global optimization, Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms, On duality for a class of quasiconcave multiplicative programs, The complementary convex structure in global optimization, An outer approximation method for minimizing the product of several convex functions on a convex set, A global optimization approach for solving the convex multiplicative programming problem, Global optimization for robust control synthesis based on the Matrix Product Eigenvalue Problem, Linear multiplicative programming, A new global optimization approach for convex multiplicative programming, Global optimization algorithm for a generalized linear multiplicative programming, \(NP\)-hardness of linear multiplicative programming and related problems, Global minimization of a generalized convex multiplicative function, The simplex method as a global optimizer: A \(C\)-programming perspective, Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set

Cites Work

• On a class of quadratic programs
• Constrained global optimization: algorithms and applications
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Generalized linear multiplicative and fractional programming
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• A Successive Underestimation Method for Concave Minimization Problems
• Quasi-concavity and pseudo-concavity of cubic functions
• Function minimization by conjugate gradients
• Solving Bicriterion Mathematical Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item