In this paper, we examine properties of topical (increasing and plus-homogeneous) functions defined on a normed linear space <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${X}$$</EquationSource> </InlineEquation>. We also study many results of abstract convexity such as support set, polarity and subdifferential set of these functions. Finally, we give a characterization...</equationsource></inlineequation>

In the first part of this work, we presented a global optimization algorithm, Branch-and-Sandwich, for optimistic bilevel programming problems that satisfy a regularity condition in the inner problem (Kleniati and Adjiman in J Glob Optim, <CitationRef CitationID="CR16">2014</CitationRef>). The proposed approach can be interpreted as the...</citationref>

The goal of this work is the development of a black-box solver based on the scatter search methodology. In particular, we seek a solver capable of obtaining high quality outcomes to optimization problems for which solutions are represented as a vector of integer values. We refer to these...

The Multisource Weber problem, also known as the continuous location-allocation problem, or as the Fermat-Weber problem, is considered here. A particular case of the Multisource Weber problem is the minimum sum-of-distances clustering problem, also known as the continuous <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$p$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi>p</mi> </math> </EquationSource> </InlineEquation>-median...</equationsource></equationsource></inlineequation>

This paper examines the influence of two major aspects on the solution quality of surrogate model algorithms for computationally expensive black-box global optimization problems, namely the surrogate model choice and the method of iteratively selecting sample points. A random sampling strategy...

In this paper we obtain a result on Hyers–Ulam stability of the linear functional equation in a single variable <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$f(\varphi (x))=g(x) \cdot f(x)$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mrow> <mi>f</mi> <mo stretchy="false">(</mo> <mi mathvariant="italic">φ</mi> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> <mo stretchy="false">)</mo> <mo>=</mo> <mi>g</mi> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> <mo>·</mo> <mi>f</mi> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> </math> </EquationSource> </InlineEquation> on a complete metric group. Copyright Springer Science+Business Media New York 2014

Proteins are important molecules that are widely studied in biology. Since their three-dimensional conformations can give clues about their function, an optimal methodology for the identification of such conformations has been researched for many years. Experiments of Nuclear Magnetic Resonance...

In this paper we describe PAVER 2.0, an environment (i.e. a process and a suite of tools supporting that process) for the automated performance analysis of benchmarking data. This new environment improves on its predecessor by addressing some of the shortcomings of the original PAVER (Bussieck...

Branch and bound methods for finding all solutions of a global optimization problem in a box frequently have the difficulty that subboxes containing no solution cannot be easily eliminated if they are close to the global minimum. This has the effect that near each global minimum, and in the...

   We compare two established and a new method for the calculation of spectral bounds for Hessian matrices on hyperrectangles by applying them to a large collection of 1,522 objective and constraint functions extracted from benchmark global optimization problems. Both the tightness of the...