Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions
From MaRDI portal
(Redirected from Publication:344937)
Abstract: Nearly convex sets play important roles in convex analysis, optimization and theory of monotone operators. We give a systematic study of nearly convex sets, and construct examples of subdifferentials of lower semicontinuous convex functions whose domain or ranges are nonconvex.
Recommendations
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 2226571 (Why is no real title available?)
- Almost convex functions: conjugacy and duality
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex analysis and nonlinear optimization. Theory and examples.
- Convex functions, monotone operators and differentiability.
- Duality for almost convex optimization problems via the perturbation approach
- Fenchel's duality theorem for nearly convex functions
- Firmly nonexpansive mappings and maximally monotone operators: correspondence and duality
- Fitzpatrick Functions and Continuous Linear Monotone Operators
- Fitzpatrick functions, cyclic monotonicity and Rockafellar's antiderivative
- From Hahn--Banach to monotonicity
- Functional analysis and infinite-dimensional geometry
- Handbook of generalized convexity and generalized monotonicity
- Image d'une somme d'opérateurs monotones et applications
- Lagrangian duality and cone convexlike functions
- Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings
- On the maximal domain of a monotone function
- On the virtual convexity of the domain and range of a nonlinear maximal monotone operator
- Techniques of variational analysis
- The resolvent average of monotone operators: dominant and recessive properties
- Uses of Generalized Convexity and Generalized Monotonicity in Economics
- Variational Analysis
Cited in
(11)- Variational analysis on the signed distance functions
- The set of controllable multi-input systems is generically convex
- The forward-backward algorithm and the normal problem
- Subsmooth functions and sets
- Generalized relative interiors and generalized convexity in infinite-dimensional spaces
- Optimality conditions for nonconvex problems over nearly convex feasible sets
- On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint
- Near equality and almost convexity of functions with applications to optimization and error bounds
- On the range of the Douglas-Rachford operator
- On a relation between the nonconvexity of a set and the nonconvexity of its \(\epsilon\)-neighborhood
- Approximate optimality conditions and sensitivity analysis in nearly convex optimization
This page was built for publication: Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344937)