Publication
The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments
The convex feasibility problem asks to find a point in the intersection of a collection of nonempty closed convex sets. This problem is of basic importance in mathematics and the physical sciences, and projection (or splitting) methods solve it by employing the projection operators associated with the individual sets to generate a sequence which converges to a solution. Motivated by an application in road design, we present the method of cyclic intrepid projections (CycIP) and provide a rigorous convergence analysis. We also report on very promising numerical experiments in which CycIP is compared to a commercial state-of-the-art optimization solver.PDF
Related Resources
See what’s new.
2005
PearlView: Non-Disruptive Hyper-List BrowsingWe present PearlView, a graphical UI component helping users to…
2021
Inferring CAD Modeling Sequences using Zone GraphsIn computer-aided design (CAD), the ability to “reverse engineer” the…
1999
The Adoption and Use of ‘BABBLE’: A Field Study of Chat in the WorkplaceOne way to gain a principled understanding of computer-mediated…
2012
Learning Hatching for Pen-and-Ink Illustration of SurfacesThis paper presents an algorithm for learning hatching styles from…
Get in touch
Something pique your interest? Get in touch if you’d like to learn more about Autodesk Research, our projects, people, and potential collaboration opportunities.
Contact us