Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 38 (2) , 538-565
- https://doi.org/10.1137/s036301299732626x
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Hilbertian Convex Feasibility Problem: Convergence of Projection MethodsApplied Mathematics & Optimization, 1997
- Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projectionsIEEE Transactions on Image Processing, 1997
- Finding projections onto the intersection of convex sets in hilbert spacesNumerical Functional Analysis and Optimization, 1995
- Dykstra′s Alternating Projection Algorithm for Two SetsJournal of Approximation Theory, 1994
- Inconsistent signal feasibility problems: least-squares solutions in a product spaceIEEE Transactions on Signal Processing, 1994
- Iterative methods for solving ill-posed problems with a priori information in Hilbert spacesUSSR Computational Mathematics and Mathematical Physics, 1988
- Solving Optimization Problems with many Constraints by a Sequence of Subproblems Containing only two ConstraintsMathematische Nachrichten, 1976
- Constrained minimization methodsUSSR Computational Mathematics and Mathematical Physics, 1966
- On a relaxation method of solving systems of linear inequalitiesUSSR Computational Mathematics and Mathematical Physics, 1963
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959