Results 11  20
of
1,202,794
Steered sequential projections for the inconsistent convex feasibility problem, Nonlinear Anal. 59
, 2004
"... We study a steered sequential gradient algorithm which minimizes the sum of convex functions by proceeding cyclically in the directions of the negative gradients of the functions and using steered stepsizes. This algorithm is applied to the convex feasibility problem by minimizing a proximity func ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We study a steered sequential gradient algorithm which minimizes the sum of convex functions by proceeding cyclically in the directions of the negative gradients of the functions and using steered stepsizes. This algorithm is applied to the convex feasibility problem by minimizing a proximity
Projection Algorithm with Line Search for Solving the Convex Feasibility Problem 1
, 2007
"... Abstract. An iterative projection algorithm by adopting Armijolike line search to solve the convex feasibility problem (CFP) is presented and the convergence is shown under some conditions. Moreover, as a byproduct, the unfixed stepsize factor is not confined to the interval (0, 2). A numerical te ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. An iterative projection algorithm by adopting Armijolike line search to solve the convex feasibility problem (CFP) is presented and the convergence is shown under some conditions. Moreover, as a byproduct, the unfixed stepsize factor is not confined to the interval (0, 2). A numerical
On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
, 2008
"... We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or halfspaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation parameters in a specific selfadapting 1 manner. This strategy ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or halfspaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation parameters in a specific selfadapting 1 manner. This strategy
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems 1
"... Abstract We further analyze the convergence and the complexity of a dual column generation algorithm for solving general convex feasibility problems defined by a separation oracle. The oracle is called at an approximate analytic center of the set given by the intersection of the linear inequalities ..."
Abstract
 Add to MetaCart
Abstract We further analyze the convergence and the complexity of a dual column generation algorithm for solving general convex feasibility problems defined by a separation oracle. The oracle is called at an approximate analytic center of the set given by the intersection of the linear inequalities
A finite step algorithm for solving convex feasibility problems. Submitted to
 SIAM Journal of Optimization
"... Abstract. This paper develops an approach 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 ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. This paper develops an approach 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
The method of reflectionprojection for convex feasibility problems with an obtuse cone
, 2002
"... The convex feasibility problem asks to find a point in the intersection of finitely many closed convex sets in Euclidean space. This problem is of fundamental importance in mathematics and physical sciences, and it can be solved algorithmically by the classical method of cyclic projections. In this ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The convex feasibility problem asks to find a point in the intersection of finitely many closed convex sets in Euclidean space. This problem is of fundamental importance in mathematics and physical sciences, and it can be solved algorithmically by the classical method of cyclic projections
S.G.: Reflectionprojection method for convex feasibility problems with an obtuse cone
 Journal of Optimization Theory and Applications
, 2004
"... Abstract. The convex feasibility problem asks to find a point in the intersection of finitely many closed convex sets in Euclidean space. This problem is of fundamental importance in the mathematical and physical sciences, and it can be solved algorithmically by the classical method of cyclic projec ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Abstract. The convex feasibility problem asks to find a point in the intersection of finitely many closed convex sets in Euclidean space. This problem is of fundamental importance in the mathematical and physical sciences, and it can be solved algorithmically by the classical method of cyclic
An Analytic Center SelfConcordant Cut Method for the Convex Feasibility Problem
, 2000
"... . We consider a case of the convex feasibility problem where the set is defined by an infinite number of certain strongly convex selfconcordant inequalities. At each iteration, the algorithm adds a selfconcordant cut through an approximate analytic center of the current set of localization until a f ..."
Abstract
 Add to MetaCart
. We consider a case of the convex feasibility problem where the set is defined by an infinite number of certain strongly convex selfconcordant inequalities. At each iteration, the algorithm adds a selfconcordant cut through an approximate analytic center of the current set of localization until a
Research Article Iterative Approximation to Convex Feasibility Problems in Banach Space
, 2007
"... The convex feasibility problem (CFP) of finding a point in the nonempty intersection ∩Ni=1Ci is considered, where N ≥ 1 is an integer and each Ci is assumed to be the fixed point set of a nonexpansive mapping Ti: E → E, where E is a reflexive Banach space with a weakly sequentially continuous dualit ..."
Abstract
 Add to MetaCart
The convex feasibility problem (CFP) of finding a point in the nonempty intersection ∩Ni=1Ci is considered, where N ≥ 1 is an integer and each Ci is assumed to be the fixed point set of a nonexpansive mapping Ti: E → E, where E is a reflexive Banach space with a weakly sequentially continuous
On the Effectiveness of Projection Methods for Convex Feasibility Problems with Linear Inequality Constraints
"... The effectiveness of projection methods for solving systems of linear inequalities is investigated. It is shown that they often have a computational advantage over alternatives that have been proposed for solving the same problem and that this makes them successful in many realworld applications. ..."
Abstract

Cited by 33 (17 self)
 Add to MetaCart
The effectiveness of projection methods for solving systems of linear inequalities is investigated. It is shown that they often have a computational advantage over alternatives that have been proposed for solving the same problem and that this makes them successful in many realworld applications
Results 11  20
of
1,202,794