Related papers: Solution analysis for a class of set-inclusive gen…
In the present paper, some aspects of the finite-dimensional theory of set-inclusive generalized equations are studied. Set-inclusive generalized equations are problems arising in several contexts of optimization and variational analysis,…
Generalized equations are problems emerging in contexts of modern variational analysis as an adequate formalism to treat such issues as constraint systems, optimality and equilibrium conditions, variational inequalities, differential…
We prove an abstract criterion that a surjective convolution operator in spaces of analytic functions on convex subsets of the complex plane has a continuous linear right inverse. Considered convex sets have a countable neighborhood basis…
We prove conditions for the existence of a continuous linear right inverse for a surjective convolution operator in spaces of germs of analytic functions on convex subsets of the complex plane. Considered convex sets have a countable…
It is established that general s-convex functions are a new class of generalized convex functions. In a similar vein, a new class of general s-convex sets is introduced, which are generalizations of s-convex sets. Additionally, certain…
We define convexity canonically in the setting of monoids. We show that many classical results from convex analysis hold for functions defined on such groups and semigroups, rather than only on vector spaces. Some examples and…
Generalized models provide a framework for the study of evolution equations without specifying all functional forms. The generalized formulation of problems has been shown to facilitate the analytical investigation of local dynamics and has…
A novel approach is introduced to a very widely occurring problem, providing a complete, explicit resolution of it: minimisation of a convex quadratic under a general quadratic, equality or inequality, constraint. Completeness comes via…
We provide a unified framework for a systematic analysis of the existence of solutions to general nonconvex problems, relying on asymptotic and retractive cones for functions and sets. Using this framework we develop new necessary and…
The geometric problem of estimating an unknown compact convex set from evaluations of its support function arises in a range of scientific and engineering applications. Traditional approaches typically rely on estimators that minimize the…
We describe general heuristics to approximately solve a wide variety of problems with convex objective and decision variables from a nonconvex set. The heuristics, which employ convex relaxations, convex restrictions, local neighbor search…
A class of generalized Schr\"{o}dinger elliptic problems involving concave-convex and other types of nonlinearities is studied. A reasonable overview about the set of solutions is provided when the parameters involved in the equation assume…
In this paper we introduce an enhanced notion of extremal systems for sets in locally convex topological vector spaces and obtain efficient conditions for set extremality in the convex case. Then we apply this machinery to deriving new…
Composite functions have been studied for over 40 years and appear in a wide range of optimization problems. Convex analysis of these functions focuses on (i) conditions for convexity of the function based on properties of its components,…
Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total…
Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…
The main purpose of this paper is to determine the solution of generalized convex set-valued mappings satisfying certain functional equation. Some conclusions of stability of set-valued functional equations are obtained.
We treat the classical notion of convexity in the context of hard real analysis. Definitions of the concept are given in terms of defining functions and quadratic forms, and characterizations are provided of different concrete notions of…
A number of results related to statistical classification on convex sets are presented. In particular, the focus is on the case where some of the covariates in the data and observation being classified can be missing. The form of the…
The generalized symmetry method is applied to a class of completely discrete equations including the Adler-Bobenko-Suris list. Assuming the existence of a generalized symmetry, we derive a few integrability conditions suitable for testing…