Concave minimization via conical partitions and polyhedral outer approximation

An algorithm is proposed for globally minimizing a concave function over a compact convex set. This algorithm combines typical branch-and-bound elements like partitioning, bounding and deletion with suitably introduced cuts in such a way that the computationally most expensive subroutines of previous methods are avoided. In each step, essentially only few linear programming problems have to be solved. Some preliminary computational results are reported.

[1]  K. Grasse,et al.  A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization , 1986 .

[2]  Reiner Horst,et al.  An algorithm for nonconvex programming problems , 1976, Math. Program..

[3]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .

[4]  R. Horst,et al.  Outer approximation by polyhedral convex sets , 1987 .

[5]  J. B. Rosen,et al.  Methods for global concave minimization: A bibliographic survey , 1986 .

[6]  R. Horst,et al.  On the convergence of global methods in multiextremal optimization , 1987 .

[7]  R. Horst.  On consistency of bounding operations in deterministic global optimization , 1989 .

[8]  Reiner Horst,et al.  A note on the convergence of an algorithm for nonconvex programming problems , 1980, Math. Program..

[9]  Panos M. Pardalos,et al.  Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.

[10]  Nguyen V. Thoai,et al.  Convergent Algorithms for Minimizing a Concave Function , 1980, Math. Oper. Res..

[11]  Reiner Horst,et al.  Deterministic methods in constrained global optimization: Some recent advances and new fields of application , 1990 .

[12]  Hoang Tuy,et al.  A class of exhaustive cone splitting procedures in conical algorithms for concave minmization , 1987 .

[13]  R. Horst,et al.  On an outer approximation concept in global optimization , 1989 .

[14]  R. Horst,et al.  Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities , 1988 .

[15]  R. Horst,et al.  On finding new vertices and redundant constraints in cutting plane algorithms for global optimization , 1988 .

[16]  H. Tuy,et al.  A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set , 1985, Math. Oper. Res..

[17]  R. Hoprst,et al.  Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization , 1988 .

[18]  Karla L. Hoffman,et al.  A method for globally minimizing concave functions over convex sets , 1981, Math. Program..

[19]  T. V. Thieu.  A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications , 1988 .

[20]  R. Horst,et al.  On the global minimization of concave functions , 1984 .

[21]  Harold P. Benson,et al.  On the convergence of two branch-and-bound algorithms for nonconvex programming problems , 1982 .