Skip navigation
Skip navigation

A Finite Steps Algorithm for Solving Convex Feasibility Problems

Rami, M. Ait; Helmke, Uwe; Moore, John

Description

This paper develops a new variant of the classical alternating projection method for solving convex feasibility problems where the constraints are given by the intersection of two convex cones in a Hilbert space. An extension to the feasibility problem for the intersection of two convex sets is presented as well. It is shown that one can solve such problems in a finite number of steps and an explicit upper bound for the required number of steps is obtained. As an application, we propose a new...[Show more]

CollectionsANU Research Publications
Date published: 2007
Type: Journal article
URI: http://hdl.handle.net/1885/28993
Source: Journal of Global Optimization
DOI: 10.1007/s10898-006-9088-y

Download

File Description SizeFormat Image
01_Rami_A_Finite_Steps_Algorithm_for_2007.pdf265.5 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator