Abstract
We propose a discretization algorithm for solving a class of nonsmooth convex semi-infinite programming problems that is based on a bundle method. Instead of employing the inexact calculation to evaluate the lower level problem, we shall carry out a discretization scheme. The discretization method is used to get a number of discretized problems which are solved by the bundle method. In particular, the subproblem used to generate a new point is independent of the number of constraints of the discretized problem. We apply a refinement-step which can be used to guarantee the convergence of the bundle method for the discretized problems as well as reduce the cost of the evaluations for the constraint functions during iteration. In addition we adopt an aggregation technique to manage the bundle information coming from previous steps. Both theoretical convergence analysis and preliminary computational results are reported. The results obtained have shown the good performance of the new algorithm.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
References
Bagirov, A., Karmitsa, N., Mäkelä, M.M.: Introduction to Nonsmooth Optimization: Theory, Practice and Software. Springer, Cham (2014)
Barrodale, I., Delves, L.M., Mason, J.C.: Linear chebyshev approximation of complex-valued functions. Math. Comput. 32, 853–863 (1978)
Bonnans, J.F., Gilbert, J.C., Lemarchal, C., Sagastizbal, C.A.: Numerical Optimization: Theoretical and Practical Aspects. Springer, Berlin (2006)
Dam, H.H., Teo, K.L., Nordebo, S., Cantoni, A.: The dual parameterization approach to optimal least square fir filter design subject to maximum error constraints. IEEE Trans. Signal Process. 48(8), 2314–2320 (2000)
Gustafson, S.-Å., Kortanek, K.: Semi-infinite programming and applications. In: Bachem, A., Korte, B., Grötschel, M. (eds.) Mathematical Programming the State of the Art, pp. 132–157. Springer, Berlin (1983)
Hare, W., Sagastizábal, C.: A redistributed proximal bundle method for nonconvex optimization. SIAM J. Optim. 20(5), 2442–2473 (2010)
Hettich, R.: An implementation of a discretization method for semi-infinite programming. Math. Program. 34(3), 354–361 (1986)
Hettich, R., Kortanek, K.O.: Semi-infinite programming: theory, methods, and applications. Soc. Ind. Appl. Math. 35(3), 380–429 (1993)
Kelley, J.E.: The cutting-plane method for solving convex programs. Soc. Ind. Appl. Math. 8(4), 703–712 (1960)
Kiwiel, K.C.: Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization. Math. Program. 52(1), 285–302 (1991)
Kiwiel, K.C.: Methods of Descent for Nondifferentiable Optimization, vol. 1133. Springer, Berlin (2006)
Kortanek, K.O., No, H.: A central cutting plane algorithm for convex semi-infinite programming problems. SIAM J. Optim. 3(4), 901–918 (1993)
Liu, Z., Gong, Y.H.: Semi-infinite quadratic optimisation method for the design of robust adaptive array processors. IEE Proc. Radar Signal Process. 137, 177–182 (1990)
López, M., Still, G.: Semi-infinite programming. Eur. J. Oper. Res. 180(2), 491–518 (2007)
Lv, J., Pang, L.P., Xu, N., Xiao, Z.H.: An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems. Numer. Algorithms 80, 397–427 (2018)
Mehrotra, S., Papp, D.: A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization. SIAM J. Optim. 24(4), 1670–1697 (2014)
Okuno, T., Fukushima, M.: Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints. J. Glob. Optim. 60(1), 25–48 (2014)
Okuno, T., Hayashi, S., Fukushima, M.: A regularized explicit exchange method for semi-infinite programs with an infinite number of conic constraints. SIAM J. Optim. 22(3), 1009–1028 (2012)
Pang, L.P., Lv, J., Wang, J.H.: Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems. Comput. Optim. Appl. 64(2), 433–465 (2016)
Polyak, B.T.: Subgradient methods: a survey of Soviet research. In: Nonsmooth Optimization (Proceedings of the IIASA Workshop, Laxenburg, 1977), IIASA Proc. Ser., vol. 3, pp. 5–29. Pergamon, Oxford (1978)
Potchinkov, A., Reemtsen, R.: The design of fir filters in the complex plane by convex optimization. Sig. Process. 46(2), 127–146 (1995)
Sagastizábal, C., Solodov, M.: An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter. SIAM J. Optim. 16(1), 146–169 (2005)
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)
Still, G.: Discretization in semi-infinite programming: the rate of convergence. Math. Program. 91(1), 53–69 (2001)
Tichatschke, R., Nebeling, V.: A cutting-plane method for quadratic semi infinite programming problems. Optimization 19(6), 803–817 (1988)
Žaković, S., Rustem, B.: Semi-infinite programming and applications to minimax problems. Ann. Oper. Res. 124(1), 81–110 (2003)
Zhang, L.P., Wu, S.Y.: An efficient algorithm for min–max convex semi-infinite programming problems. Numer. Funct. Anal. Optim. 37(8), 1037–1053 (2016)
Zhang, L.P., Wu, S.Y., López, M.A.: A new exchange method for convex semi-infinite programming. SIAM J. Optim. 20(6), 2959–2977 (2010)
Acknowledgements
This work was supported by the Key Research and Development Projects of Shandong Province (No. 2019GGX104089), the Natural Science Foundation of Shandong Province (No. ZR2019BA014).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Pang, LP., Wu, Q., Wang, JH. et al. A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods. Comput Optim Appl 76, 125–153 (2020). https://doi.org/10.1007/s10589-020-00170-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-020-00170-6