2011•Unpublished venueRequires access

Block-Iterative Subgradient Projection Algorithms for the Convex Feasibility Problem

Yazheng Dang, Yan Gao, Zhi Li-ping

Abstract

In this paper, sequential block-iterative subgradient projection algorithm and parallel block-iterative subgradient projection algorithm for solving the convex feasibility problem expressed by the system of inequalities are presented. Each step in these methods consists of finding the approximation projection of the current point on the subsystem which is constructed through parting the system of inequalities into several blocks. The convergence for both of sequential block-iterative subgradient projection algorithm and parallel block-iterative subgradient projection algorithm are obtained under some weak conditions.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Subgradient method, Projection (relational algebra), Mathematics, Algorithm, Iterative method, Block (permutation group theory), Mathematical optimization, Regular polygon