A method for globally minimizing concave functions over convex sets

Publisher Website

1 December 1981

journal article
Published by Springer Nature in Mathematical Programming

Vol. 20 (1) , 22-32
https://doi.org/10.1007/bf01589330

Abstract

No abstract available

Keywords

This publication has 7 references indexed in Scilit:

An algorithm for nonconvex programming problems
Mathematical Programming, 1976
A Successive Underestimation Method for Concave Minimization Problems
Mathematics of Operations Research, 1976
Algorithmic and computational aspects of the use of optimization methods in engineering design
Computers & Structures, 1973
An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
Management Science, 1971
An Algorithm for Separable Nonconvex Programming Problems
Management Science, 1969
A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
Management Science, 1961
The Cutting-Plane Method for Solving Convex Programs
Journal of the Society for Industrial and Applied Mathematics, 1960