Results 61 to 70 of about 2,308 (150)
Subdifferential Test for Optimality
We provide a first-order necessary and sufficient condition for optimality of lower semicontinuous functions on Banach spaces using the concept of subdifferential.
Jules, Florence, Lassonde, Marc
core +3 more sources
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
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
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
Derivatives of orbital function and an extension of Berezin-Gel’fand’s theorem
A generalization of a result of Berezin and Gel’fand in the context of Eaton triples is given. The generalization and its proof are Lie-theoretic free and requires some basic knowledge of nonsmooth analysis.
Tam Tin-Yau, Hill William C.
doaj +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
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
The approximate and the Clarke subdifferentials can be different everywhere
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source

