Results 61 to 70 of about 2,296 (157)
Abstract We construct a differentiable locally Lipschitz function f$f$ in RN$\mathbb {R}^{N}$ with the property that for every convex body K⊂RN$K\subset \mathbb {R}^N$ there exists x¯∈RN$\bar{x} \in \mathbb {R}^N$ such that K$K$ coincides with the set ∂Lf(x¯)$\partial _L f(\bar{x})$ of limits of derivatives {Df(xn)}n⩾1$\lbrace Df(x_n)\rbrace _{n ...
Aris Daniilidis +2 more
wiley +1 more source
Geometric conditions for regularity in a time-minimum problem with constant dynamics [PDF]
Continuing the earlier research on local well-posedness of a time-minimum problem associated to a closed target set C in a Hilbert space H and a convex constant dynamics F we study the Lipschitz (or, in general, Hölder) regularity of the (unique) point ...
Goncharov, Vladimir, Pereira, Fátima
core
The graphical abstract delves into Caputo fractional nonlinear differential inclusions, highlighting their complexities and the need for innovative solutions. We propose a mild solution approach to address these challenges efficiently. Our investigation focuses on determining the existence of mild solutions under varied conditions and exploring optimal
Marimuthu Mohan Raja +4 more
wiley +1 more source
A Neural Network Based on a Nonsmooth Equation for a Box Constrained Variational Inequality Problem
The variational inequality framework holds significant prominence across various domains including economic finance, network transportation, and game theory. In addition, a novel approach utilizing a neural network model is introduced in the current work to address a box constrained variational inequality problem.
Yanan Wang +4 more
wiley +1 more source
Packing ellipsoids with overlap
The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm for the general
Uhler, Caroline, Wright, Stephen J.
core +1 more source
A Nonconvex Proximal Bundle Method for Nonsmooth Constrained Optimization
An implementable algorithm for solving nonsmooth nonconvex constrained optimization is proposed by combining bundle ideas, proximity control, and the exact penalty function. We construct two kinds of approximations to nonconvex objective function; these two approximations correspond to the convex and concave behaviors of the objective function at the ...
Jie Shen +3 more
wiley +1 more source
Infinitely many solutions for an anisotropic differential inclusion on unbounded domains
The problem deals with the anisotropic $p(x)$-Laplacian operator where $p_i$ are Lipschitz continuous functions $2\leq p_i(x)
Giovany Figueiredo, Abdolrahman Razani
doaj +1 more source
Characterizations of Super-regularity and its Variants
Convergence of projection-based methods for nonconvex set feasibility problems has been established for sets with ever weaker regularity assumptions.
A Daniilidis +10 more
core +1 more source
We prove that every function $f:\mathbb{R}^n\to \mathbb{R}$ satisfies that the image of the set of critical points at which the function $f$ has Taylor expansions of order $n-1$ and non-empty subdifferentials of order $n$ is a Lebesgue-null set.
Azagra, Daniel +2 more
core +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Zhenhai +2 more
openaire +3 more sources

