On a convex set with nondifferentiable metric projection
نویسندگان
چکیده
منابع مشابه
On a convex set with nondifferentiable metric projection
A remarkable example of a nonempty closed convex set in the Euclidean plane for which the directional derivative of the metric projection mapping fails to exist was constructed by A. Shapiro. In this paper, we revisit and modify that construction to obtain a convex set with C boundary which possesses the same property.
متن کاملA Class of Methods for Projection on a Convex Set
The paper is concerning about the basic optimization problem of projecting a point onto a convex set. We present a class of methods where the problem is reduced to a sequence of projections onto the intersection of several balls. The subproblems are much simpler and more tractable, but the main advantage is that, in so doing, we can avoid solving linear systems completely and thus the methods a...
متن کاملA Decomposition Algorithm for Convex Nondifferentiable Minimization with Errors
A decomposition algorithm based on proximal bundle-type method with inexact data is presented for minimizing an unconstrained nonsmooth convex function f . At each iteration, only the approximate evaluation of f and its approximate subgradients are required which make the algorithm easier to implement. It is shown that every cluster of the sequence of iterates generated by the proposed algorith...
متن کاملThe Performance of Convex Set Projection Based Neural Networks
We donsider a class of neural networks whose performance can be analyzed and geometrically visualized in a signal space environment. Alternating projection neural networks (APNN' s) perform by alternately projecting between two or more constraint sets. Criteria for desired and unique convergence are easily established. The network can be configured in either a homogeneous or layered form. The n...
متن کاملConvex Hulls of Spatial Polygons with a Fixed Convex Projection
Let F be a convex n-gon in a horizontal plane of the Euclidean 3-space. Consider its spatial variation under which its vertices move vertically and let F be the convex hull of such a variation. In the general position, the boundary of F splits naturally into the "bottom" F 0 and the "top" F 00. The polyhedron F 0 (F 00) has triangular faces and no vertices inside. The projection of these faces ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2015
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-015-0847-x