Abstract
We propose an inexact proximal bundle method for constrained nonsmooth nonconvex optimization problems whose objective and constraint functions are known through oracles which provide inexact information. The errors in function and subgradient evaluations might be unknown, but are merely bounded. To handle the nonconvexity, we first use the redistributed idea, and consider even more difficulties by introducing inexactness in the available information. We further examine the modified improvement function for a series of difficulties caused by the constrained functions. The numerical results show the good performance of our inexact method for a large class of nonconvex optimization problems. The approach is also assessed on semi-infinite programming problems, and some encouraging numerical experiences are provided.
Similar content being viewed by others
References
Ackooij, W., Sagastizábal, C.: Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems. SIAM J. Optim. 24, 733–765 (2014)
Apkarian, P., Noll, D., Prot, O.: A proximity control algorithm to minimize nonsmooth and nonconvex semi-infinite maximum eigenvalue functions. J. Convex Anal. 16, 641–666 (2009)
Borwein, J.M., Lewis, A.S.: Convex Analysis and Nonlinear Optimization: Theory and Examples, 2nd edn. Springer, Berlin (2006)
Curtis, F.E., Overton, M.L.: A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization. SIAM J. Optim. 22, 474–500 (2012)
d’Antonio, G., Frangioni, A.: Convergence analysis of deflected conditional approximate subgradient methods. SIAM. J. Optim. 20, 357–386 (2009)
de Oliveira, W., Sagastizábal, C., Scheimberg, S.: Inexact bundle methods for two-stage stochastic programming. SIAM J. Optim. 21, 517–544 (2011)
de Oliveira, W., Sagastizábal, C., Lemaréchal, C.: Convex proximal bundle methods in depth: a unified analysis for inexact oracles. Math. Program. 148, 241–277 (2014)
Daniilidis, A., Georgiev, P.: Approximate convexity and submonotonicity. J. Math. Anal. Appl. 291, 292–301 (2004)
Emiel, G., Sagastizábal, C.: Incremental-like bundle methods with application to energy planning. Comput. Optim. Appl. 46, 305–332 (2010)
Fábián, C., Szöke, Z.: Solving two-stage stochastic programming problems with level decomposition. Comput. Manag. Sci. 4, 313–353 (2007)
Ferrier, C.: Bornes Duales de Problémes d’Optimisation Polynomiaux, Ph.D. thesis. Laboratoire Approximation et Optimisation, Université Paul Sabatier, Toulouse (1997)
Ferrier, C.: Computation of the distance to semi-algebraic sets. ESAIM Control Optim. Calc. Var. 5, 139–156 (2000)
Floudas, C.A., Stein, O.: The adaptive convexification algorithm: a feasible point method for semi-infinite programming. SIAM J. Optim. 18, 1187–1208 (2007)
Fuduli, A., Gaudioso, M., Giallombardo, G.: A DC piecewise affine model and a bundling technique in nonconvex nonsmooth optimization. Optim. Methods Softw. 19, 89–102 (2004)
Fuduli, A., Gaudioso, M., Giallombardo, G.: Minimizing nonconvex nonsmooth functions via cutting planes and proximity control. SIAM J. Optim. 14, 743–756 (2004)
Goberna, M.A., López, M.A.: Linear Semi-Infinite Optimization. Wiley, New-York (1998)
Hare, W., Sagastizábal, C.: Computing proximal points of nonconvex functions. Math. Program. 116, 221–258 (2009)
Hare, W., Sagastizábal, C.: A redistributed proximal bundle method for nonconvex optimization. SIAM J. Optim. 20, 2442–2473 (2010)
Hare, W., Sagastizábal, C., Solodov, M.: A proximal bundle method for nonconvex functions with inexact oracles. Comput. Optim. Appl. 63, 1–28 (2016)
Hintermüller, M.: A proximal bundle method based on approximate subgradients. Comput. Optim. Appl. 20, 245–266 (2001)
Hiriart-Urruty, J.-B., Lemaréchal, C.: Convex Analysis and Minimization Algorithms. II, Volume 306 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], Springer, Berlin (1993). Advanced theory and bundle methods
Jongen, H.T., Rückmann, J.-J., Stein, O.: Generalized semi-infinite optimization: a first order optimality condition and examples. Math. Program. 83, 145–158 (1998)
Karas, E., Ribeiro, A., Sagastizȧbal, C., Solodov, M.: A bundle-filter method for nonsmooth convex constrained optimization. Math. Program. 116, 297–320 (2009)
Kiwiel, K.C.: Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Mathematics. Springer, Berlin (1985)
Kiwiel, K.C.: An algorithm for nonsmooth convex minimization with errors. Math. Comput. 45, 171–180 (1985)
Kiwiel, K.C.: A linearization algorithm for nonsmooth minimization. Math. Oper. Res. 10, 185–194 (1985)
Kiwiel, K.C.: An exact penalty function algorithm for nonsmooth convex constrained minimization problems. IMA J. Numer. Anal. 5, 111–119 (1985)
Kiwiel, K.C.: Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization. Math. Program. 52, 285–302 (1991)
Kiwiel, K.C.: Restricted step and Levenberg–Marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization. SIAM J. Optim. 6, 227–249 (1996)
Kiwiel, K.C.: Convergence of approximate and incremental subgradient methods for convex optimization. SIAM. J. Optim. 14, 807–840 (2004)
Kiwiel, K.C.: A proximal bundle method with approximate subgradient linearizations. SIAM. J. Optim. 16, 1007–1023 (2006)
Kiwiel, K.C.: A method of centers with approximate subgradient linearizations for nonsmooth convex optimization. SIAM J. Optim. 18, 1467–1489 (2008)
Kiwiel, K.C., Lemaréchal, C.: An inexact bundle variant suited to column generation. Math. Program. 118, 177–206 (2009)
Kortanek, K.O., No, H.: A central cutting plane algorithm for convex semi-infinite programming problems. SIAM J. Optim. 3, 901–918 (1993)
Lemaréchal, C., Nemirovskii, A., Nesterov, Y.: New variants of bundle methods. Math. Program. 69, 111–147 (1995)
Lukšan, L., Vlček, J.: A bundle-Newton method for nonsmooth unconstrained minimization. Math. Program. 83, 373–391 (1998)
Lv, J., Pang, L.P., Wang, J.H.: Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization. Appl. Math. Comput. 265, 635–651 (2015)
Mifflin, R.: An algorithm for constrained optimization with semismooth functions. Math. Oper. Res. 2, 191–207 (1977)
Mifflin, R.: A modification and extension of Lemarechal’s algorithm for nonsmooth minimization. Math. Program. Stud. 17, 77–90 (1982)
Mifflin, R.: A quasi-second-order proximal bundle algorithm. Math. Program. 73, 51–72 (1996)
Nedić, A., Bertsekas, D.P.: The effect of deterministic noise in subgradient methods. Math. Program. 125, 75–99 (2010)
Noll, D.: Bundle method for non-convex minimization with inexact subgradients and function values. Comput. Anal. Math. 50, 555–592 (2013)
Pang, L.P., Lv, J.: Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems. Comput. Optim. Appl. 64, 433–465 (2016)
Rockafellar, R.T., Wets, J.J.-B.: Variational Analysis. Springer, Berlin (1998)
Rustem, B., Nguyen, Q.: An algorithm for the inequality-constrained discrete minimax problem. SIAM J. Optim. 8, 265–283 (1998)
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, 146–169 (2005)
Solodov, M.V., Zavriev, S.K.: Error stabilty properties of generalized gradient-type algorithms. J. Optim. Theory Appl. 98, 663–680 (1998)
Solodov, M.V.: On approximations with finite precision in bundle methods for nonsmooth optimization. J. Optim. Theory Appl. 119, 151–165 (2003)
Spingarn, J.E.: Submonotone subdifferentials of Lipschitz functions. Trans. Am. Math. Soc. 264, 77–89 (1981)
Stein, O.: Bi-Level Strategies in Semi-Infinite Programming. Kluwer, Boston (2003)
Stein, O.: On constraint qualifications in nonsmooth optimization. J. Optim. Theory. Appl. 121, 647–671 (2004)
Tang, C.M., Liu, S., Jian, J.B., Li, J.L.: A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization. Numer. Algor. 65, 1–22 (2014)
Tichatschke, R., Nebeling, V.: A cutting plane method for quadratic semi-infinite programming problems. Optimization. 19, 803–817 (1988)
Wolfe, P.: A method of conjugate subgradients for minimizing nondifferentiable functions. In: Balinski, M.L., Wolfe, P. (eds.) Nondifferentiable Optimization. Math. Program. Stud., 3, pp. 145–173. North-Holland, Amsterdam (1975)
Yang, Y., Pang, L.P., Ma, X.F., Shen, J.: Constrained nonconvex nonsmooth optimization via proximal bundle method. J. Optim. Theory Appl. 163, 900–925 (2014)
Zhang, L.P., Wu, S.-Y., López, M.A.: A new exchange method for convex semi-infinite programming. SIAM J. Optim. 20, 2959–2977 (2010)
Acknowledgements
The authors wish to thank Editor-in-Chief Sergiy Butenko, the preceding managing editors and the anonymous reviewers for their helpful comments on the earlier version of this paper, which considerably improved both the presentation and the numerical experiments. We also gratefully acknowledge the support of the Huzhou science and technology plan on No. 2016GY03 and Natural Science Foundation of China Grant 11626051.
Author information
Authors and Affiliations
Corresponding author
Additional information
Partially supported by Huzhou science and technology plan on No. 2016GY03 and Natural Science Foundation of China Grant 11626051.
Rights and permissions
About this article
Cite this article
Lv, J., Pang, LP. & Meng, FY. A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information. J Glob Optim 70, 517–549 (2018). https://doi.org/10.1007/s10898-017-0565-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-017-0565-2
Keywords
- Constrained optimization
- Nonconvex optimization
- Nonsmooth optimization
- Inexact oracle
- Proximal bundle method