Steklov regularization and trajectory methods for univariate global optimization

DOI10.1007/s10898-019-00837-3zbMath1448.90077arXiv1809.04530OpenAlexW2980794445WikidataQ127029700 ScholiaQ127029700MaRDI QIDQ2301181

Orhan Arıkan, Regina Sandra Burachik, C. Yalçın Kaya

Publication date: 28 February 2020

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.04530

zbMATH Keywords

global optimizationtrajectory methodsSteklov smoothingmean filterscale-shift invarianceSteklov regularization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution to global minimization of polynomials by backward differential flow
• Deterministic global optimization. Geometric branch-and-bound methods and their applications
• Smoothing methods for nonsmooth, nonconvex minimization
• ``Backward differential flow may not converge to a global minimizer of polynomials
• A reassessment of the Snyman-Fatti dynamic search trajectory method for unconstrained global optimization
• Convergence rates for forward-backward dynamical systems associated with strongly monotone inclusions
• Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
• Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
• The Minimization of Semicontinuous Functions: Mollifier Subgradients
• An algorithm for finding the absolute extremum of a function
• Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
• Nonlinear Programming

This page was built for publication: Steklov regularization and trajectory methods for univariate global optimization