We introduce a new regularization technique, using what we refer to as the Steklov regularization function, and apply this technique to devise an algorithm that computes a global minimizer of univariate coercive functions. First, we show that the Steklov regularization convexifies a given univariate coercive function. Then, by using the regularization parameter as the independent variable, a trajectory is constructed on the surface generated by the Steklov function. For monic quartic polynomials, we prove that this trajectory does generate a global minimizer. In the process, we derive some properties of quartic polynomials. Comparisons are made with a previous approach which uses a quadratic regularization function. We carry out numerical experiments to illustrate the working of the new method on polynomials of various degree as well as a non-polynomial function.
Global optimization Mean filter Steklov smoothing Steklov regularization Scale–shift invariance Trajectory methods
This is a preview of subscription content, log in to check access.
The authors offer their warm thanks to an anonymous referee whose comments and suggestions improved the paper.
Arıkan, O., Burachik, R.S., Kaya, C.Y.: “Backward differential flow” may not converge to a global minimizer of polynomials. J. Optim. Theory Appl. 167, 401–408 (2015)MathSciNetCrossRefGoogle Scholar
Arnold, V.I.: Ordinary Differential Equations. The MIT Press, Cambridge (1978)Google Scholar
Attouch, H., Chbani, Z., Peypouquet, J., Redont, P.: Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity. Math. Program. 168(1–2), 123–175 (2018)MathSciNetCrossRefGoogle Scholar
Borelli, R.L., Coleman, C.S.: Differential Equations. Wiley, New York (2004)Google Scholar
Bazaraa, M.S., Sherali, H.D., Shetti, C.M.: Nonlinear Programming: Theory and Algorithms, 3rd edn. Wiley, Hoboken (2006)CrossRefGoogle Scholar
Boţ, R.I., Csetnek, E.R.: Convergence rates for forward-backward dynamical systems associated with strongly monotone inclusions. J. Math. Anal. Appl. 457(2), 1135–1152 (2018)MathSciNetCrossRefGoogle Scholar
Ermoliev, Y.M., Norkin, V.I., Wets, R.J.-B.: The minimization of semicontinuous functions: mollifier subgradients. SIAM J. Control Optim. 32, 149–167 (1995)MathSciNetCrossRefGoogle Scholar
Garmanjani, R., Vicente, L.N.: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization. IMA J. Numer. Anal. 33, 1008–1028 (2013)MathSciNetCrossRefGoogle Scholar
Gupal, A.M.: On a method for the minimization of almost-differentiable functions. Cybern. Syst. Anal. 13, 115–117 (1977)CrossRefGoogle Scholar
Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Berlin (1996)CrossRefGoogle Scholar
Lera, D., Sergeyev, Y.D.: Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives. SIAM J. Optim. 23(1), 508–529 (2013)MathSciNetCrossRefGoogle Scholar