D.c. sets, d.c. functions and nonlinear equations

Ad.c. set is a set which is the difference of two convex sets. We show that any set can be viewed as the image of a d.c. set under an appropriate linear mapping. Using this universality we can convert any problem of finding an element of a given compact set in ℝn into one of finding an element of a d.c. set. On the basis of this approach a method is developed for solving a system of nonlinear equations—inequations. Unlike Newton-type methods, our method does not require either convexity, differentiability assumptions or an initial approximate solution.

[1]  Panos M. Pardalos,et al.  Global minimization of large-scale constrained concave quadratic problems by separable programming , 1986, Math. Program..

[2]  James E. Falk,et al.  A Successive Underestimation Method for Concave Minimization Problems , 1976, Math. Oper. Res..

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

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

[5]  B. Mukhamediev Approximate method of solving concave programming problems , 1982 .

[6]  Hoang Tuy,et al.  Concave minimization under linear constraints with special structure , 1985 .

[7]  J. Hiriart-Urruty Generalized Differentiability / Duality and Optimization for Problems Dealing with Differences of Convex Functions , 1985 .

[8]  James B. Orlin,et al.  On the complexity of four polyhedral set containment problems , 2018, Math. Program..

[9]  H. Tuy A General Deterministic Approach to Global Optimization VIA D.C. Programming , 1986 .

[10]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

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

[12]  H. Tuy,et al.  Global optimization under Lipschitzian constraints , 1987 .

[13]  R. Rockafellar Favorable Classes of Lipschitz Continuous Functions in Subgradient Optimization , 1981 .

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

[15]  B. Eaves,et al.  Generalized Cutting Plane Algorithms , 1971 .

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