Shorter Notes: Differentiability of the Metric Projection in Finite- Dimensional Euclidean Space
From MaRDI portal
Publication:5686616
DOI10.2307/2038801zbMath0269.52002OpenAlexW1985534288MaRDI QIDQ5686616
Publication date: 1973
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/113904
Differentiation (real functions of one variable): general theory, generalized derivatives, mean value theorems (26A24) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)
Related Items
Best approximations from Hilbert submanifolds, Concave duality: Application to problems dealing with difference of functions, Differentiability of the Metric Projection in Hilbert Space, Moreau's decomposition theorem revisited, Differentiability of the distance function and points of multi-valuedness of the metric projection in Banach space, Generalized second-order derivatives and optimality conditions, Regularity of the distance function from arbitrary closed sets, A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems, Convex analysis in normed spaces and metric projections onto convex bodies, Finite-Dimensional Banach Spaces with A.E. Differentiable Metric Projection, The directional subdifferential of the difference of two convex functions, A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions, A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection, On differentiation of metric projections in finite dimensional Banach spaces, On the subdifferentiability of the difference of two functions and local minimization, Nondifferentiability properties of the nearest point mapping, Proximal mappings, Fine properties of the curvature of arbitrary closed sets, The conjugate of the difference of convex functions, A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems