Reflection-Projection Method for Convex Feasibility Problems with an Obtuse Cone

AbstractThe 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 projections.In this paper, the case where one of the constraints is an obtuse cone is considered. Because the nonnegative orthant as well as the set of positive-semidefinite symmetric matrices form obtuse cones, we cover a large and substantial class of feasibility problems. Motivated by numerical experiments, the method of reflection-projection is proposed: it modifies the method of cyclic projections in that it replaces the projection onto the obtuse cone by the corresponding reflection.This new method is not covered by the standard frameworks of projection algorithms because of the reflection. The main result states that the method does converge to a solution whenever the underlying convex feasibility problem is consistent. As prototypical applications, we discuss in detail the implementation of two-set feasibility problems aiming to find a nonnegative [resp. positive semidefinite] solution to linear constraints in ℝn [resp. in $$\mathbb{S}^n $$ , the space of symmetric n×n matrices] and we report on numerical experiments. The behavior of the method for two inconsistent constraints is analyzed as well.

[1]  S. Agmon.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[2]  W. Cheney,et al.  Proximity maps for convex sets , 1959 .

[3]  E. H. Zarantonello.  Projections on Convex Sets in Hilbert Space and Spectral Theory: Part I. Projections on Convex Sets: Part II. Spectral Theory , 1971 .

[4]  C. W. Groetsch,et al.  Generalized inverses of linear operators : representation and approximation , 1977 .

[5]  B. Parlett.  The Symmetric Eigenvalue Problem , 1981 .

[6]  Jean-Louis Goffin,et al.  The Relaxation Method for Solving Systems of Linear Inequalities , 1980, Math. Oper. Res..

[7]  Gene H. Golub,et al.  Matrix computations , 1983 .

[8]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[9]  A. Pierro,et al.  On the asymtotic behavior of some alternate smoothing series expansion iterative methods , 1990 .

[10]  W. A. Kirk,et al.  Topics in Metric Fixed Point Theory , 1990 .

[11]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[12]  Andrzej Cegielski,et al.  Projection onto an acute cone and convex feasibility problem , 1993, System Modelling and Optimization.

[13]  Heinz H. Bauschke,et al.  Dykstra's Alternating Projection Algorithm for Two Sets , 1994 .

[14]  Heinz H. Bauschke,et al.  On Projection Algorithms for Solving Convex Feasibility Problems , 1996, SIAM Rev..

[15]  Osman Güler,et al.  Barrier Functions in Interior Point Methods , 1996, Math. Oper. Res..

[16]  K. Kiwiel.  The Efficiency of Subgradient Projection Methods for Convex Optimization , 1996 .

[17]  Heinz H. Bauschke,et al.  Projection algorithms and monotone operators , 1996 .

[18]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[19]  Michael J. Todd,et al.  Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..

[20]  C. Roos,et al.  Infeasible Start Semidefinite Programming Algorithms Via Self-Dual Embeddings , 1997 .

[21]  Krzysztof C. Kiwiel,et al.  Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings , 1997, SIAM J. Optim..

[22]  P. L. Combettes,et al.  Hilbertian convex feasibility problem: Convergence of projection methods , 1997 .

[23]  Heinz H. Bauschke,et al.  The method of cyclic projections for closed convex sets in Hilbert space , 1997 .

[24]  K. Kiwiel.  Monotone gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems , 1997 .

[25]  Z. Luo,et al.  Conic convex programming and self-dual embedding , 1998 .

[26]  Stephen P. Boyd,et al.  Applications of second-order cone programming , 1998 .

[27]  Andrzej Cegielski,et al.  A method of projection onto an acute cone with level control in convex minimization , 1999, Math. Program..

[28]  Adrian S. Lewis,et al.  Convex Analysis And Nonlinear Optimization , 2000 .

[29]  Henry Wolkowicz,et al.  Handbook of Semidefinite Programming , 2000 .

[30]  R. Saigal,et al.  Handbook of semidefinite programming : theory, algorithms, and applications , 2000 .

[31]  P. L. Combettes,et al.  Quasi-Fejérian Analysis of Some Optimization Algorithms , 2001 .

[32]  Heinz H. Bauschke.  Projection Algorithms: Results and Open Problems , 2001 .

[33]  A. Cegielski.  Obtuse cones and Gram matrices with nonnegative inverse , 2001 .

[34]  G. Crombez.  PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS , 2002 .

[35]  A. Cegielski,et al.  Residual Selection in A Projection Method for Convex Minimization Problems , 2003 .

[36]  Dinh Van Huynh,et al.  Algebra and Its Applications , 2006 .