Convex programs with an additional constraint on the product of several convex functions

DOI10.1016/0377-2217(94)90375-1zbMath0827.90114OpenAlexW1980686870MaRDI QIDQ1333464

Hiroshi Konno, Yasutoshi Yajima, Yoshitsugu Yamamoto, Takahito Kuno

Publication date: 13 December 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90375-1

zbMATH Keywords

outer approximation algorithmproduct of convex functionsreverse convex problem

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

On jet-convex functions and their tensor products, Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type, Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint, Branch-and-reduce algorithm for convex programs with additional multiplicative constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An outer approximation method for minimizing the product of several convex functions on a convex set
• Convex programs with an additional reverse convex constraint
• On a class of quadratic programs
• Constrained global optimization: algorithms and applications
• Linear programs with an additional reverse convex constraint
• Reverse convex programming
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Mathematical programs with a two-dimensional reverse convex constraint
• A parametric successive underestimation method for convex multiplicative programming problems
• Linear multiplicative programming
• Generalized linear multiplicative and fractional programming
• Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• Minimization of continuous convex functional on complements of convex subsets of locally convex spaces¹
• A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
• Solving Bicriterion Mathematical Programs
• Point-to-Set Maps in Mathematical Programming