Abstract
This chapter presents methods and algorithms for solving the basic dc optimization problems: concave minimization under linear constraints (Sect. 7.1), concave minimization under convex constraints (Sect. 7.2), reverse convex programming (Sect. 7.3), general canonical dc optimization problem (Sect. 7.4), general robust approach to dc optimization (Sect. 7.5), and also applications of dc optimization in various fields (Sects. 7.6–7.8) such as design calculations, location, distance geometry, and clustering. An important new result in this chapter is a surprisingly simple proof of the convergence of algorithms using ω-subdivision—a question which had remained open during two decades before being settled with quite sophisticated proofs by Locatelli (Math Program 85:593–616, 1999), Jaumard and Meyer (J Optim Theory Appl 110:119–144, 2001), and more recently Kuno and Ishihama (J Glob Optim 61:203–220, 2015). In addition, the new concept of ω-bisection by Kuno–Ishihama is introduced as a substitute for ω-subdivision.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In the above formulation the function h(x) is assumed to be finite throughout \(\mathbb{R}^{n};\) if this condition may not be satisfied (as in the last example) certain results below must be applied with caution.
References
Al-Khayyal, F.A., Tuy, H., Zhou, F.: DC optimization methods for multisource location problems. School of Industrial and Systems Engineering. George Institute of Technology, Atlanta (1997). Preprint
Al-Khayyal, F.A., Tuy, H., Zhou, F.: Large-scale single facility continuous location by DC Optimization. Optimization 51, 271–292 (2002)
An, L.T.H.: Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian Transform and D.C. Programming. J. Glob. Optim. 27, 375–397 (2003)
An, L.T.H., Belghiti, M.T., Tao, P.D.: A new efficient algorithm based on DC programming and DCA for clustering. J. Glob. Optim. 37, 557–569 (2007)
Balas, E.: Intersection cuts—a new type of cutting planes for integer programming. Oper. Res. 19, 19–39 (1971)
Balas, E.: Integer programming and convex analysis: intersection cuts and outer polars. Math. Program. 2, 330–382 (1972)
Bradley, P.S., Mangasarian, O.L., Street, W.N.: Clustering via concave minimization. Technical report 96–03. Computer Science Department, University of Wisconsin (1997)
Brimberg, J., Love, R.F.: A location problem with economies of scale. Stud. Locat. Anal. (7), 9–19 (1994)
Bulatov, V.P. Methods for solving multiextremal problems (Global Search). In Beltiukov, B.A., Bulatov, V.P. (eds) Methods of Numerical Analysis and Optimization. Nauka, Novosibirsk (1987) (Russian)
Chen, P.C., Hansen, P., Jaumard, B.: On-line and off-line vertex enumeration by adjacency lists. Oper. Res. Lett. 10, 403–409 (1991)
Chen, P.-C., Hansen, P., Jaumard, B., Tuy, H.: Weber’s problem with attraction and repulsion. J. Regional Sci. 32, 467–486 (1992)
Chen, P.-C., Hansen, P., Jaumard, B., Tuy, H.: Solution of the multifacility Weber and conditional Weber problems by D.C. Programming, Cahier du GERAD G-92-35. Ecole Polytechnique, Montréal (1992b)
Falk, J.E., Hoffman, K.L.: A successive underestimation method for concave minimization problems. Math. Oper. Res. 1, 251–259 (1976)
Falk, J.E., Hoffman, K.L.: Concave minimization via collapsing polytopes. Oper. Res. 34, 919–929 (1986)
Falk, J.E., Soland, R.M.L: An algorithm for separable nonconvex programming problems. Manag. Sci. 15, 550–569 (1969)
Glover, F.: Cut search methods in integer programming. Math. Program. 3, 86–100 (1972)
Glover, F.: Convexity cuts and cut search. Oper. Res. 21, 123–124 (1973a)
Glover, F.: Concave programming applied to a special class of 0–1 integer programs. Oper. Res. 21, 135–140 (1973b)
Hamami, M., Jacobsen, S.E.: Exhaustive non-degenerate conical processes for concave minimization on convex polytopes. Math. Oper. Res. 13, 479–487 (1988)
Hillestad, R.J., Jacobsen, S.E.: Linear programs with an additional reverse convex constraint. Appl. Math. Optim. 6, 257–269 (1980b)
Hoffman, K.L.: A method for globally minimizing concave functions over convex sets. Math. Program. 20, 22–32 (1981)
Horst, R., Tuy, H.: Global Optimization (Deterministic Approaches), 3rd edn. Springer, Berlin/Heidelberg/New York (1996)
Horst, R., Thoai, N.V., Benson, H.P.: Concave minimization via conical partitions and polyhedral outer approximation. Math. Program. 50, 259–274 (1991)
Horst, R., Thoai, N.V., de Vries, J.: On finding new vertices and redundant constraints in cutting plane algorithms for global optimization. Oper. Res. Lett. 7, 85–90 (1988)
Idrissi, H., Loridan, P., Michelot, C.: Approximation for location problems. J. Optim. Theory Appl. 56, 127–143 (1988)
Jaumard, B., Meyer, C.: On the convergence of cone splitting algorithms with ω-subdivisions. J. Optim. Theory Appl. 110, 119–144 (2001)
Kalantari, B., Rosen, J.B.: An algorithm for global minimization of linearly constrained concave quadratic problems. Math. Oper. Res. 12, 544–561 (1987)
Konno, H.: A cutting plane for solving bilinear programs. Math. Program. 11,14–27 (1976a)
Konno, H.: Maximization of a convex function subject to linear constraints. Math. Program. 11, 117–127 (1976b)
Kuno, T., Ishihama, T.: A convergent conical algorithm with ω-bisection for concave minimization. J. Glob. Optim. 61, 203–220 (2015)
Lasserre, J.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796–817 (2001)
Locatelli, M.: Finiteness of conical algorithm with ω-subdivisions. Math. Program. 85, 593–616 (1999)
Mangasarian, O.L.: Mathematical programming data mining. In: Data Mining and Knowledge Discovery, vol. 1, pp. 183–201 (1997)
Maranas, C.D., Floudas, C.A.: A global optimization method for Weber’s problem with attraction and repulsion. In: Hager, W.W., Hearn, D.W., Pardalos, P.M. (eds.) Large Scale Optimization, pp. 259–293. Kluwer, Dordrecht (1994)
Muu, L.D.: A convergent algorithm for solving linear programs with an additional reverse convex constraint. Kybernetika 21, 428–435 (1985)
Saff, E.B., Kuijlaars, A.B.J.: Distributing many points on a sphere. Math. Intell. 10, 5–11 (1997)
Sherali, H.D., Adams, W.P.: A Reformulation-Lineralization Technique (RLT) for Solving Discrete and Continuous Nonconvex Programming Problems. Kluwer, Dordrecht (1999)
Shiau, T.-H.: Finding the largest l p-ball in a polyhedral set. Technical Summary Report No. 2788. University of Wisconsin, Mathematics Research Center, Madison (1984)
Suzuki, A., Okabe, A.: Using Voronoi diagrams. In: Drezner, Z. (ed.) Facility Location, pp. 103–118. Springer, New York (1995)
Thach, P.T.: The design centering problem as a d.c. programming problem. Math. Program. 41, 229–248 (1988)
Thieu, T.V.: Improvement and implementation of some algorithms for nonconvex optimization problems. In: Optimization—Fifth French German Conference, Castel Novel 1988. Lecture Notes in Mathematics, vol. 1405, pp. 159–170. Springer, Berlin (1989)
Thieu, T.V., Tam, B.T., Ban, V.T.: An outer approximation method for globally minimizing a concave function over a compact convex set. Acta Math. Vietnam 8, 21–40 (1983)
Thoai, N.V.: A modified version of Tuy’s method for solving d.c. programming problems. Optimization 19, 665–674 (1988)
Thoai, N.V., Tuy, H.: Convergent algorithms for minimizing a concave function. Math. Oper. Res. 5, 556–566 (1980)
Tuy, H.: Concave programming under linear constraints. Sov. Math. Dokl. 5, 1437–1440 (1964)
Tuy, H.: Convex Programs with an additional reverse convex constraint. J. Optim. Theory Appl. 52, 463–486 (1987a)
Tuy, H.: Convex Analysis and Global Optimization. Kluwer, Dordrecht (1998)
Tuy, H.: Normal conical algorithm for concave minimization over polytopes. Math. Program. 51, 229–245 (1991)
Tuy, H.: Canonical d.c. programming: outer approximation methods revisited. Oper. Res. Lett. 18, 99–106 (1995b)
Tuy, H.: On global optimality conditions and cutting plane algorithms. J. Optim. Theory Appl. 118, 201–216 (2003)
Tuy, H., Horst, R.: Convergence and restart in branch and bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems. Math. Program. 42, 161–184 (1988)
Tuy, H., Migdalas, A., Väbrand, P.: A global optimization approach for the linear two-level program. J. Glob. Optim. 3, 1–23 (1992)
Tuy, H., Al-Khayyal, F., Zhou, F.: A d.c. optimization method for single facility location problems. J. Glob. Optim. 7, 209–227 (1995a)
Tuy, H., Ghannadan, S., Migdalas, A., Värbrand, P.: The minimum concave cost flow problem with fixed numbers of nonlinear arc costs and sources. J. Glob. Optim. 6, 135–151 (1995b)
Tuy, H., Al-Khayyal, F., Zhou, P.C.: DC optimization method for single facility location problems. J. Glob. Optim. 7, 209–227 (1995c)
Tuy, H., Bagirov, Rubinov, A.M.: Clustering via D.C. optimization. In: Hadjisavvas, N., Pardalos, P.M. (eds.) Advances in Convex Analysis and Optimization, pp. 221–235. Kluwer, Dordrecht (2001)
Veinott, A.F.: The supporting hyperplane method for unimodal programming. Oper. Res. 15, 147–152 (1967)
Vidigal, L., Director, S.: A design centering algorithm for nonconvex regions of acceptability. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 14, 13–24 (1982)
Wolberg, W.H., Street, W.N., Mangasarian, O.L.: Machine learning techniques to diagnose breast cancer from fine-needle aspirates. Cancer Lett. 77, 163–171 (1994)
Wolberg, W.H., Street, W.N., Mangasarian, O.L.: Image analysis and machine learning applied to breast cancer diagnosis and prognosis. Anal. Quant. Cytol. Histol. 17 (2), 77–87 (1995)
Wolberg, W.H., Street, W.N., Heisey, D.M., Mangasarian, O.L.: Computerized breast cancer diagnosis and prognosis from fine-needle aspirates. Arch. Surg. 130, 511–516 (1995a)
Wolberg, W.H., Street, W.N., Heisey, D.M., Mangasarian, O.L.: Computer-derived nuclear features distinguish malignant from benign beast cytology. Hum. Pathol. 26, 792–796 (1995b)
Zwart, P.B.: Global maximization of a convex function with linear inequality constraints. Oper. Res. 22, 602–609 (1974)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this chapter
Cite this chapter
Tuy, H. (2016). DC Optimization Problems. In: Convex Analysis and Global Optimization. Springer Optimization and Its Applications, vol 110. Springer, Cham. https://doi.org/10.1007/978-3-319-31484-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-31484-6_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-31482-2
Online ISBN: 978-3-319-31484-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)