Minimizing the sum of a convex function and the product of two affine functions over a convex set
From MaRDI portal
Publication:4327904
DOI10.1080/02331939208843779zbMath0817.90113MaRDI QIDQ4327904
Publication date: 1 August 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939208843779
global optimization; branch-and-bound; numerical efficiency; sum of a convex function and the product of two affine functions
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
49J52: Nonsmooth analysis
Related Items
Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming, Outcome-space cutting-plane algorithm for linear multiplicative programming, Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions, Minimizing the sum of a convex function and a specially structured nonconvex function
Cites Work