Well-posedness of approximation and optimization problems for weakly convex sets and functions

DOI10.1007/s10958-015-2485-3zbMath1353.90176OpenAlexW1140488992MaRDI QIDQ267593

Mariana S. Lopushanski, Grigorii E. Ivanov

Publication date: 11 April 2016

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-015-2485-3

zbMATH Keywords

well-posednessinfimal convolution problemweakly convex functionsweakly convex sets

Mathematics Subject Classification ID

Programming in abstract spaces (90C48)

Related Items (5)

Connectedness in asymmetric spaces ⋮ A separation theorem for nonconvex sets and its applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Supporting and separating for rough convex set

Cites Work

• Well-posedness of minimal time problems with constant dynamics in Banach spaces
• Uniform convexity and the splitting problem for selections
• Weakly convex sets and their properties
• Prox-regular sets and epigraphs in uniformly convex Banach spaces: Various regularities and other properties
• Strong and Weak Convexity of Sets and Functions
• Curvature Measures
• A criterion of smooth generating sets
• Local differentiability of distance functions
• $ M$-strongly convex subsets and their generating sets
• Weakly convex and proximally smooth sets in Banach spaces
• Proximité et dualité dans un espace hilbertien
• Convex Analysis
• Sets with external Chebyshev layer
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Well-posedness of approximation and optimization problems for weakly convex sets and functions