Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems. (English) Zbl 1373.90082
Summary: In this paper, we generalize the extended supporting hyperplane algorithm for a convex continuously differentiable mixed-integer nonlinear programming problem to solve a wider class of nonsmooth problems. The generalization is made by using the subgradients of the Clarke subdifferential instead of gradients. Consequently, all the functions in the problems are assumed to be locally Lipschitz continuous. The algorithm is shown to converge to a global minimum of an MINLP problem if the objective function is convex and the constraint functions are \(f^{\circ}\)-pseudoconvex. With some additional assumptions, the constraint functions may be \(f^{\circ}\)-quasiconvex.
Keywords:
MINLP; extended supporting hyperplane method; convex optimization; nonsmooth optimization; Clarke subdifferential; generalized convexitiesReferences:
| [1] | Arnold, T., Henrion, R., Moller, A., Vigerske, S.: A mixed-integer stochastic nonlinear optimization problem with joint probabilistic constraints. Pac. J. Optim. 10, 5-20 (2014) · Zbl 1294.90014 |
| [2] | Bagirov, A., Mäkelä, M.M., Karmitsa, N.: Introduction to Nonsmooth Optimization: Theory, Practice and Software. Springer, Cham (2014) · Zbl 1312.90053 · doi:10.1007/978-3-319-08114-4 |
| [3] | Bonami, P., Cournuéjols, G., Lodi, A., Margot, F.: A feasibility pump for mixed integer nonlinear programs. Math. Program. 119, 331-352 (2009) · Zbl 1163.90013 · doi:10.1007/s10107-008-0212-2 |
| [4] | Castillo, I., Westerlund, J., Emet, S., Westerlund, T.: Optimization of block layout design problems with unequal areas: a comparison of MILP and MINLP optimization methods. Comput. Chem. Eng. 30, 54-69 (2005) · doi:10.1016/j.compchemeng.2005.07.012 |
| [5] | Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley-Interscience, New York (1983) · Zbl 0582.49001 |
| [6] | de Oliveira, W.: Regularized optimization methods for convex MINLP problems. TOP 24, 665-692 (2016) · Zbl 1358.90086 · doi:10.1007/s11750-016-0413-4 |
| [7] | Emet, S., Westerlund, T.: Comparisons of solving a chromatographic separation problem using MINLP methods. Comput. Chem. Eng. 28, 673-682 (2004) · doi:10.1016/j.compchemeng.2004.02.010 |
| [8] | Eronen, V.-P., Mäkelä, M.M., Westerlund, T.: Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems. Optimization 64(3), 641-661 (2015) · Zbl 1311.90083 |
| [9] | Kronqvist, J., Lundell, A., Westerlund, T.: The ESH algorithm for convex mixed-integer nonlinear programming. J. Glob. Optim. 64(2), 249-272 (2016) · Zbl 1339.90247 |
| [10] | Meller, R.D., Narayanan, V., Vance, P.H.: Optimal facility layout design. Oper. Res. Lett. 23, 117-127 (1999) · Zbl 0959.90036 · doi:10.1016/S0167-6377(98)00024-8 |
| [11] | Pörn, R.: Mixed-Integer Non-Linear Programming: Convexification Techniques and Algorithm Development. Ph.D. Thesis, Åbo Akademi University (2000) · Zbl 1163.90013 |
| [12] | Schramm, H., Zowe, J.: A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results. SIAM J. Optim. 2(1), 121-152 (1992) · Zbl 0761.90090 · doi:10.1137/0802008 |
| [13] | Veinott Jr., A.F.: The supporting hyperplane method for unimodal programming. Oper. Res. 15(1), 147-152 (1967) · Zbl 0147.38604 · doi:10.1287/opre.15.1.147 |
| [14] | Westerlund, T., Pörn, R.: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques. Optim. Eng. 3, 253-280 (2002) · Zbl 1035.90051 · doi:10.1023/A:1021091110342 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
