Finding a best approximation pair of points for two polyhedra

Ron Aharoni (), Yair Censor () and Zilin Jiang ()
Additional contact information
Ron Aharoni: Technion – Israel Institute of Technology
Yair Censor: University of Haifa
Zilin Jiang: Technion – Israel Institute of Technology

Computational Optimization and Applications, 2018, vol. 71, issue 2, No 9, 509-523

Abstract: Abstract Given two disjoint convex polyhedra, we look for a best approximation pair relative to them, i.e., a pair of points, one in each polyhedron, attaining the minimum distance between the sets. Cheney and Goldstein showed that alternating projections onto the two sets, starting from an arbitrary point, generate a sequence whose two interlaced subsequences converge to a best approximation pair. We propose a process based on projections onto the half-spaces defining the two polyhedra, which are more negotiable than projections on the polyhedra themselves. A central component in the proposed process is the Halpern–Lions–Wittmann–Bauschke algorithm for approaching the projection of a given point onto a convex set.

Keywords: Best approximation pair; Convex polyhedra; Alternating projections; Half-spaces; Cheney–Goldstein theorem; Halpern–Lions–Wittmann–Bauschke algorithm; 65K05; 90C20; 90C25 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-018-0021-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:71:y:2018:i:2:d:10.1007_s10589-018-0021-3

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-018-0021-3

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().