Pith. sign in

REVIEW

On Error Bounds of Inequalities in Asplund 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

arxiv 2311.09884 v1 pith:HX3QXBJK submitted 2023-11-16 math.OC

On Error Bounds of Inequalities in Asplund Spaces

classification math.OC
keywords errorfunctionboundsdualinequalityasplundconditionsconvex
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Error bounds are central objects in optimization theory and its applications. They were for a long time restricted only to the theory before becoming over the course of time a field of itself. This paper is devoted to the study of error bounds of a general inequality defined by a proper lower semicontinuous function on an Asplund space. Even though the results of the dual characterization on the error bounds of a general inequality (if one drops the convexity assumption) may not be valid, several necessary dual conditions are still obtained in terms of Fr\'echet/Mordukhovich subdifferentials of the concerned function at points in the solution set. Moreover, for an inequality defined by a composite-convex function that is to say by a function which is the composition of a convex function with a smooth mapping, such dual conditions also turn out to be sufficient to have the error bound property. Our work is an extension of results on dual characterizations of convex inequalities to the possibly non-convex case.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.