zbMATH — the first resource for mathematics

A successive projection method. (English) Zbl 0685.90074
Summary: It is of both theoretical and practical interest to find the projection of a point to the intersection of a finite number of closed convex sets by a sequence of projections to the individual sets successively. In this paper we study such a method and analyze its convergence properties. A main feature of the method is its capability to decompose the projection problem into several small ones. For some structured sparse problems these small subproblems can be solved independently and the presented method has a potential use in parallel computation.

90C20 Quadratic programming
65K05 Numerical mathematical programming methods
PDF BibTeX Cite
Full Text: DOI
[1] C.W. Cryer, ”The solution of a quadratic programming problem using systematic overrelaxation,”SIAM Journal on Control 22 (1971) 385–392. · Zbl 0216.54603
[2] U. Eckhardt, ”Quadratic programming by successive overrelaxation,” Kernforschungsanlage Jülich, Technical Report No. Jül-1064-MA, 1974.
[3] S.-P. Han and G. Lou, ”A parallel algorithm for a class of convex programs,” to appear inSIAM Journal on Control and Optimization (Oct., 1986).
[4] O.L. Mangasarian, ”Solution of symmetric linear complementarity problem by iterative methods,”Journal of Optimization Theory and its Applications 22 (1977) 465–485. · Zbl 0341.65049
[5] J.J. Moré, ”The Levenberg-Marquardt algorithm: Implementation and theory,” in: G.A. Watson, ed.,Proceedings of the 1978 Dundee Conference on Numerical Analysis, Lecture Notes in Mathematics 630 (Springer-Verlag, Berlin, 1978) pp. 105–116.
[6] J.-J. Moreau, ”Proximité et sous-gradient d’une fonctionelle,”Bulletin de la Societe Mathematique de France 93 (1965) 273–299.
[7] R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, New Jersey, 1970). · Zbl 0193.18401
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.