Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint

DOI10.1007/s10957-009-9636-yzbMath1201.90161OpenAlexW1999790052MaRDI QIDQ987514

Harold P. Benson

Publication date: 13 August 2010

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-009-9636-y

zbMATH Keywords

global optimizationnonconvex programmingmultiplicative constraintproduct of convex functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (3)

On optimization over the efficient set of a multiple objective linear programming problem ⋮ Time-optimal velocity planning by a bound-tightening technique ⋮ Separable concave minimization via partial outer approximation and branch and bound

Cites Work

• Unnamed Item
• Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
• Convex programs with an additional constraint on the product of several convex functions
• A finite algorithm for globally optimizing a class of rank-two reverse convex programs
• Robust solution of nonconvex global optimization problems
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Introduction to global optimization.
• A new approach to optimization under monotonic constraint

This page was built for publication: Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint