Generating set search using simplex gradients for bound-constrained black-box optimization KU Leuven
The optimization problems arising in modern engineering practice are increasingly simulation-based, characterized by extreme types of nonsmoothness, the inaccessibility of derivatives, and high computational expense. While generating set searches (GSS) generally offer a satisfying level of robustness and convergence to stationary points, the convergence rates may be slow. In order to accelerate the solution process without sacrificing ...
A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima KU Leuven
Efron-Petrosian integrals for doubly truncated data with covariates: An asymptotic analysis KU Leuven
Properties of sets of Subspaces with Constant Intersection Dimension Vrije Universiteit Brussel
Period function of planar turning points Universiteit Hasselt
This paper is devoted to the study of the period function of planar generic and non-generic turning points. In the generic case (resp. non-generic) a non-degenerate (resp. degenerate) center disappears in the limit ϵ→0, where ϵ≥0 is the singular perturbation parameter. We show that, for each ϵ>0 and ϵ∼0, the period function is monotonously increasing (resp. has exactly one minimum). The result is valid in an ϵ-uniform neighborhood of the ...
Correction to: Strong convergence of a linearization method for semi-linear elliptic equations with variable scaled production Universiteit Hasselt
This article is a correction to our paper Khoa et al. (2020b).