Results 61 to 70 of about 2,024 (222)
Inequalities and counterexamples for functional intrinsic volumes and beyond
Abstract We show that analytic analogs of Brunn–Minkowski‐type inequalities fail for functional intrinsic volumes on convex functions. This is demonstrated both through counterexamples and by connecting the problem to results of Colesanti, Hug, and Saorín Gómez.
Fabian Mussnig, Jacopo Ulivelli
wiley +1 more source
This paper investigates the application of β‐open sets to the convergence analysis of nonautonomous evolution equations governed by maximal monotone operators in Hilbert spaces. β‐open sets are a class of generalized open sets introduced by Njåstad (1965), which coincides with the class of semiopen sets by Levine (1963).
Boushra Abbas, Simeon Reich
wiley +1 more source
Subdifferentiability of Real Functions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Optimality Conditions Characterizing Approximate Solutions for DC Composite Programs
This paper concerns DC composite optimization problems with conic constraints. By virtue of epigraph of conjugate functions, we introduce some new regularity conditions. Under the new regularity conditions, we give some necessary optimality conditions for ε‐optimal solutions, global optimal solutions, and local optimal solutions by using the ε ...
Gang Li, Qiqiong Chen, Smritijit Sen
wiley +1 more source
Sufficient condition for optimality is derived for the problem under consideration on the basis of the apparatus of locally conjugate mappings,and duality theorems are proved.A sufficient condition for an extremum is an extremal relation for the direct ...
E. N. MAHMUDOV
doaj +2 more sources
Inexact Inertial Proximal Algorithm for Maximal Monotone Operators
In this paper, convergence of the sequence generated by the inexact form of the inertial proximal algorithm is studied. This algorithm which is obtained by the discretization of a nonlinear oscillator with damping dynamical system, has been introduced by
Khatibzadeh Hadi, Ranjbar Sajad
doaj +1 more source
This paper defines a strong convertible nonconvex (SCN) function for solving the unconstrained optimization problems with the nonconvex or nonsmooth (nondifferentiable) function. First, the concept of SCN function is defined, where the SCN functions are nonconvex or nonsmooth.
Min Jiang +4 more
wiley +1 more source
This article develops new Hermite–Hadamard and Jensen‐type inequalities for the class of (α, m)‐convex functions. New product forms of Hermite–Hadamard inequalities are established, covering multiple distinct scenarios. Several nontrivial examples and remarks illustrate the sharpness of these results and demonstrate how earlier inequalities can be ...
Shama Firdous +5 more
wiley +1 more source
On the use of semi-closed sets and functions in convex analysis
The main aim of this short note is to show that the subdifferentiability and duality results established by Laghdir (2005), Laghdir and Benabbou (2007), and Alimohammady et al. (2011), stated in Fréchet spaces, are consequences of the corresponding known
Zălinescu Constantin
doaj +1 more source
On one consequence of the Chebyshev alternance [PDF]
The classical problem of the best approximation of a continuous function by a polynomial over a Chebyshev system of functions is considered. It is known that the solution of the problem is characterized by alternance.
Dudov, Sergei Ivanovitch +1 more
doaj +1 more source

