A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT

DOI10.15807/jorsj.35.290zbMath0780.90075OpenAlexW596018556MaRDI QIDQ5288490

Yoshitsugu Yamamoto, Hiroshi Konno, Takahito Kuno

Publication date: 12 August 1993

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.35.290

zbMATH Keywords

branch-and-boundconvex minimizationsequence of convex programming problemsadditional convex multiplicative constraint

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Convex programs with an additional constraint on the product of several convex functions, The complementary convex structure in global optimization, Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type, Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions, Branch-and-reduce algorithm for convex programs with additional multiplicative constraints