Projection on the intersection of convex sets

نویسندگان

  • Marko Stošić
  • João Xavier
  • Marija Dodig
چکیده

Article history: Received 30 October 2015 Accepted 25 July 2016 Available online 28 July 2016 Submitted by B. Lemmens MSC: 90C53 15A09

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some results on functionally convex sets in real Banach spaces

‎We use of two notions functionally convex (briefly‎, ‎F--convex) and functionally closed (briefly‎, ‎F--closed) in functional analysis and obtain more results‎. ‎We show that if $lbrace A_{alpha} rbrace _{alpha in I}$ is a family $F$--convex subsets with non empty intersection of a Banach space $X$‎, ‎then $bigcup_{alphain I}A_{alpha}$ is F--convex‎. ‎Moreover‎, ‎we introduce new definition o...

متن کامل

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

Volume difference inequalities for the projection and intersection bodies

In this paper, we introduce a new concept of volumes difference function of the projection and intersection bodies. Following this, we establish the Minkowski and Brunn-Minkowski inequalities for volumes difference function of the projection and intersection bodies.

متن کامل

TITLE AND SUBTITLE Successive Projection under a Quasi - Cyclic Order

A classical method for finding a point in the intersection of a finite collection of closed convex sets is the successive projection method. It is well-known that this method is convergent if each convex sets is chosen for projection in a cyclical manner. In this note we show that this method is still convergent if the length of the cycle grows without bound, provided that the growth is not too...

متن کامل

Variational inequalities on Hilbert $C^*$-modules

We introduce variational inequality problems on Hilbert $C^*$-modules and we prove several existence results for variational inequalities defined on closed convex sets. Then relation between variational inequalities, $C^*$-valued metric projection and fixed point theory  on  Hilbert $C^*$-modules is studied.

متن کامل

Distributed Continuous-time Approximate Projection Protocols for Shortest Distance Optimization Problems

In this paper, we investigate the distributed shortest distance optimization problem for a multi-agent network to cooperatively minimize the sum of the quadratic distances from some convex sets, where each set is only associated with one agent. To deal with the optimization problem with projection uncertainties, we propose a distributed continuous-time dynamical protocol based on a new concept ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016