In his paper [2], Ricceri considers, for X bounded convex subset of the real Hilbert space $ H,$ the quantity

$$ \begin{align*}\delta_X = \inf_{\varphi\in \Gamma_X} \Big( \sup_{x\in X} \big(\kern-1.2pt\left\Vert x\right\Vert{}^2 +\varphi(x)\big) - \inf_{x\in X} \big(\kern-1.2pt\left\Vert x\right\Vert{}^2 +\varphi(x) \Big),\end{align*} $$

$ \Gamma _X$

$\delta _X>0$

$ X$

$\delta _X$

$ X$

In this article, we show that $\delta _X$ is exactly the square of the Chebyshev radius of $ X$, hence is at least $\dfrac {\operatorname {\mathrm {{diam}}}(X)^2}4$. We deduce from the main result of [2] a quantitative statement on the zeros of a $\mathcal C^1$-operator on $ H$ with Lipschitz derivative, and show that this statement is optimal.

In this paper, we study the T-periodic solutions of the parameter-dependent ϕ-Laplacian equation

\begin{equation*}(\phi(x'))'=F(\lambda,t,x,x').\end{equation*}

Based on the topological degree theory, we present some atypical bifurcation results in the sense of Prodi–Ambrosetti, i.e., bifurcation of T-periodic solutions from λ = 0. Finally, we propose some applications to Liénard-type equations.

Dedicated to Professor Maria Patrizia Pera on the occasion of her 70th birthday

Let H be a real Hilbert space and $\Phi :H\to H$ be a $C^1$ operator with Lipschitzian derivative and closed range. We prove that $\Phi ^{-1}(0)\neq \emptyset $ if and only if, for each $\epsilon>0$, there exist a convex set $X\subset H$ and a convex function $\psi :X\to \mathbf {R}$ such that $\sup _{x\in X}(\|x\|^2+\psi (x))-\inf _{x\in X}(\|x\|^2+\psi (x))<\epsilon $ and $0\in \overline {{\mathrm {conv}}}(\Phi (X))$.

We prove that every smooth complex normed space X has the Wigner property. That is, for any complex normed space Y and every surjective mapping $f: X\rightarrow Y$ satisfying

$$ \begin{align*} \{\|f(x)+\alpha f(y)\|: \alpha\in \mathbb{T}\}=\{\|x+\alpha y\|: \alpha\in \mathbb{T}\}, \quad x,y\in X, \end{align*} $$

where $\mathbb {T}$ is the unit circle of the complex plane, there exists a function $\sigma : X\rightarrow \mathbb {T}$ such that $\sigma \cdot f$ is a linear or anti-linear isometry. This is a variant of Wigner’s theorem for complex normed spaces.

We show that for the case of uniformly convex Banach spaces, the conditions of Brøndsted’s fixed point theorem can be relaxed.

Let E be a uniformly convex and uniformly smooth real Banach space, and let E* be its dual. Let A : E → 2E* be a bounded maximal monotone map. Assume that A−1(0) ≠ Ø. A new iterative sequence is constructed which converges strongly to an element of A−1(0). The theorem proved complements results obtained on strong convergence of the proximal point algorithm for approximating an element of A−1(0) (assuming existence) and also resolves an important open question. Furthermore, this result is applied to convex optimization problems and to variational inequality problems. These results are achieved by combining a theorem of Reich on the strong convergence of the resolvent of maximal monotone mappings in a uniformly smooth real Banach space and new geometric properties of uniformly convex and uniformly smooth real Banach spaces introduced by Alber, with a technique of proof which is also of independent interest.

In this paper we present a simple (fixed point) method that yields various results concerning approximate solutions of some difference equations. The results are motivated by the notion of Ulam stability.

In this paper, we generalize monotone operators, their resolvents and the proximal point algorithm to complete CAT(0) spaces. We study some properties of monotone operators and their resolvents. We show that the sequence generated by the inexact proximal point algorithm $\unicode[STIX]{x1D6E5}$ -converges to a zero of the monotone operator in complete CAT(0) spaces. A strong convergence (convergence in metric) result is also presented. Finally, we consider two important special cases of monotone operators and we prove that they satisfy the range condition (see Section 4 for the definition), which guarantees the existence of the sequence generated by the proximal point algorithm.