On the convexification of nonlinear programming problems: An applications-oriented survey

Abstract Some important classes of decision models give rise to nonconvex minimization problems that, by domain or range transformation, are transformable into convex problems. Thus the powerful theoretical results and the efficiency of algorithms in convex programming can be exploited for a wide range of problems. If no convexifying transformation is at hand, one often requires to approximate a nonconvex objective by a convex one. Then a priori as well as post-computational errorbounds are of interest. The purpose of this paper is to outline briefly some of the ideas and results on convexification that may be useful in practice.

[1]  Mordecai Avriel,et al.  Nonlinear programming , 1976 .

[2]  B. Finetti,et al.  Sulle stratificazioni convesse , 1949 .

[3]  Gintaras V. Reklaitis,et al.  On the computational utility of posynomial geometric programming solution methods , 1982, Math. Program..

[4]  Arthur M. Geoffrion,et al.  Objective function approximations in mathematical programming , 1977, Math. Program..

[5]  S. Schaible.  Fractional Programming. I, Duality , 1976 .

[6]  S. Schaible.  Minimization of ratios , 1976 .

[7]  Clarence Zener,et al.  Geometric Programming : Theory and Application , 1967 .

[8]  R. Horst,et al.  A note on functions whose local minima are global , 1982 .

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

[10]  S. Schaible.  Fractional Programming. II, On Dinkelbach's Algorithm , 1976 .

[11]  Mordecai Avriel,et al.  r-convex functions , 1972, Math. Program..

[12]  A. Ben-Tal.  On generalized means and generalized convex functions , 1977 .

[13]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[14]  S. Schaible.  Fractional programming: Applications and algorithms , 1981 .

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

[16]  W. Ziemba,et al.  Generalized concavity in optimization and economics , 1981 .

[17]  Siegfried Schaible,et al.  Second-order characterizations of pseudoconvex quadratic functions , 1977 .

[18]  W. Fenchel.  Convex cones, sets, and functions , 1953 .

[19]  J. E. Falk,et al.  An Algorithm for Separable Nonconvex Programming Problems , 1969 .

[20]  Siegfried Schaible,et al.  Second order characterizations of pseudoconvex functions , 1975, Math. Program..

[21]  G. Debreu,et al.  Least concave utility functions , 1976 .

[22]  Yakar Kannai,et al.  Concavifiability and constructions of concave utility functions , 1977 .