REVIEW 1 cited by
Extremal Systems of Convex Sets with Applications to Convex Calculus in Vector Spaces
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In this paper we introduce and study the concept of set extremality for systems of convex sets in vector spaces without topological structures. Characterizations of the extremal systems of sets are obtained in the form of the convex extremal principle, which is shown to be equivalent to convex separation under certain qualification conditions expressed via algebraic cores. The obtained results are applied via a variational geometric approach to deriving enhanced calculus rules for normals to convex sets, coderivatives of convex set-valued mappings, and subgradients of extended-real-valued convex functions including the optimal value ones. These rules of the equality type are established under refined qualification conditions in terms of algebraic cores in arbitrary vector spaces. Our new developments partially answer the question on how far we can go with set-valued and convex analysis without any topological structure on the underlying spaces.
Forward citations
Cited by 1 Pith paper
-
A Supervised Machine Learning Framework for Multipactor Breakdown Prediction in High-Power Radio Frequency Devices and Accelerator Components: A Case Study in Planar Geometry
Random Forest and Extra Trees trained on PIC data predict planar multipactor susceptibility maps about as well as a Monte Carlo benchmark, while neural networks generalize more poorly to unseen materials.
Discussion (0). Continue with ORCID to comment.