In this paper, we provide some new necessary and sufficient conditions for pseudoconvexity and semistrict quasiconvexity of a given proper extended real-valued function in terms of the Clarke–Rockafellar subdifferential. Further, we extend to programs with pseudoconvex objective function two...

A small polygon is a convex polygon of unit diameter. We are interested in small polygons which have the largest area for a given number of vertices n. Many instances are already solved in the literature, namely for all odd n, and for n = 4, 6 and 8. Thus, for even n ≥ 10, instances of this...

This paper contributes to classification and identification in modern finance through advanced optimization. In the last few decades, financial misalignments and, thereby, financial crises have been increasing in numbers due to the rearrangement of the financial world. In this study, as one of...

Let C be a nonempty closed convex subset of a uniformly convex and 2-uniformly smooth Banach space E and let Π<Subscript> C </Subscript> be a sunny nonexpansive retraction from E onto C. Let the mappings <InlineEquation ID="IEq4"> <EquationSource Format="TEX">$${T, S: C \to E}$$</EquationSource> </InlineEquation> be γ <Subscript>1</Subscript>-strongly accretive, μ <Subscript>1</Subscript>-Lipschitz continuous and γ <Subscript>2</Subscript>-strongly accretive, μ...</subscript></subscript></subscript></subscript></equationsource></inlineequation></subscript>

Simulated annealing (SA) is a generic optimization method that is quite popular because of its ease of implementation and its global convergence properties. However, SA is widely reported to converge very slowly, and it is common practice to allow extra freedom in its design at the expense of...

In this paper, we establish some existence results for the hemivariational inequality governed by a multi-valued map perturbed with a nonlinear term in reflexive Banach spaces. Using the concept of the stable <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$f$$</EquationSource> </InlineEquation>-quasimonotonicity, the properties of Clarke’s generalized directional...</equationsource></inlineequation>

We propose in this paper a fixed parameter polynomial algorithm for the cardinality-constrained quadratic optimization problem, which is NP-hard in general. More specifically, we prove that, given a problem of size n (the number of decision variables) and s (the cardinality), if the n−k...

Gaussian mixtures (i.e. linear combinations of multivariate Gaussian probability densities) appear in numerous applications due to their universal ability to approximate multimodal probability distributions. Finding the modes (maxima) of a Gaussian mixture is a fundamental problem arising in...

It is proved that any DCA sequence constructed by Pham Dinh–Le Thi’s algorithm for the trust-region subproblem (Pham Dinh and Le Thi, in SIAM J. Optim. 8:476–505, <CitationRef CitationID="CR13">1998</CitationRef>) converges to a Karush–Kuhn–Tucker point of the problem. This result provides a complete solution for one open...</citationref>

We have developed a new financial indicator—called the Interest Rate Differentials Adjusted for Volatility (IRDAV) measure—to assist investors in currency markets. On a monthly basis, we rank currency pairs according to this measure and then select a basket of pairs with the highest IRDAV...