Related papers: Barrier functions in the subdifferential theory
The combinatorial optimization problem is one of the important applications in neural network computation. The solutions of linearly constrained continuous optimization problems are difficult with an exact algorithm, but the algorithm for…
In this paper, we consider the problem of verifying safety constraint satisfaction for single-input single-output systems with uncertain transfer function coefficients. We propose a new type of barrier function based on a vector norm. This…
Verifying set invariance has classical solutions stemming from the seminal work by Nagumo, and defining sets via a smooth barrier function constraint inequality results in computable flow conditions for guaranteeing set invariance. While a…
We propose a methodology to address two analysis problems concerning complex systems, namely bounding state functionals of stochastic differential equations (SDEs) and verifying set avoidance of systems described by partial differential…
In this study, we explore the partial identification of nonseparable models with continuous endogenous and binary instrumental variables. We show that the structural function is partially identified when it is monotone or concave in the…
We analyze matrix convex functions of a fixed order defined on a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus. We obtain for each order conditions for matrix…
The aim of this article is the explicit construction of some barrier functions ("fundamental solutions") for the Pucci-Heisenberg operators. Using these functions we obtain the continuity property, up to the boundary, for the viscosity…
In this paper, we introduce a new subclass of close-to-convex harmonic functions. We present a sufficient coefficient condition for a function to be a member of this class. Furthermore, we establish a distortion theorem. These results lay…
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
The Haraux function is an important tool in monotone operator theory and its applications. One of its salient properties for a maximally monotone operator is to be valued in $[0,+\infty]$ and to vanish only on the graph of the operator.…
In the paper, by establishing the monotonicity of some functions involving the sine and cosine functions, the authors provide concise proofs of some known inequalities and find some new sharp inequalities involving the Seiffert,…
The most important open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that Rockafellar's constraint qualification holds. In this paper, we prove the maximal…
In this paper, we unify and improve existing results on characterizing strict and almost stricty convex functions via subdifferential mapping, Moreau envelope, and proximal mappings. In particular, it is shown that if a convex function is…
This paper presents converse theorems for safety in terms of barrier functions for unconstrained continuous-time systems modeled as differential inclusions. Via a counterexample, we show the lack of existence of autonomous and continuous…
We consider the problem of minimizing a convex, separable, nonsmooth function subject to linear constraints. The numerical method we propose is a block-coordinate extension of the Chambolle-Pock primal-dual algorithm. We prove convergence…
This article presents a reformulation of the Theory of Functional Connections: a general methodology for functional interpolation that can embed a set of user-specified linear constraints. The reformulation presented in this paper exploits…
In this paper we prove a version of the Fountain Theorem for a class of nonsmooth functionals that are sum of a $C^1$ functional and a convex lower semicontinuous functional, and also a version of a theorem due to Heinz for this class of…
We revisit the problem of approximating minimizers of certain convex functionals subject to a convexity constraint by solutions of fourth order equations of Abreu type. This approximation problem was studied in previous works of…
There exist two major subclasses in the class of superquadratic functions, one comprises concave and decreasing functions, while the other consists of convex and monotone increasing functions. Leveraging this distinction, we introduce…
In this paper, an upper semismooth function is defined to be a lower semicontinuous function whose radial subderivative satisfies a mild directional upper semicontinuity property. Examples of upper semismooth functions are the proper lower…