Row-Action Methods for Huge and Sparse Systems and Their Applications
From MaRDI portal
Publication:3923522
DOI10.1137/1023097zbMath0469.65037MaRDI QIDQ3923522
Publication date: 1981
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1023097
game theory; pattern recognition; learning theory; row-action methods; iterative procedures; linearly constrained optimization problems; image reconstruction from projection, operations research; interval convex programming problems; linear feasibility problems; nonlinear convex feasibility problem; transportation theory
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C05: Linear programming
Related Items
Asymptotically optimal row-action methods for generalized least squares problems, Iterations of parallel convex projections in hilbert spaces, Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization, Unrestricted iterations of nonexpansive mappings in Banach spaces, Strong convergence of expected-projection methods in hilbert spaces, Interval underrelaxed bregman's method with an application, Application of the Finite Inclusions Theorem to robust analysis and synthesis, Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems, Hilbertian convex feasibility problem: Convergence of projection methods, A row relaxation method for large minimax problems, A row relaxation method for large \(l_ 1\) problems, Domain decomposition for parallel row projection algorithms, Level-constrained programming, Radiation therapy treatment planning: An \(\mathcal L^ 2\) approach, A parallel projection method for overdetermined nonlinear systems of equations, On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space, The simple block iterative algorithm of an extended entropy model and its convergence, New iterative methods for linear inequalities, A unified description of iterative algorithms for traffic equilibria, Parallel projection methods and the resolution of ill-posed problems, A row-action method for convex programming, A review of combinatorial problems arising in feedforward neural network design, A multiprojection algorithm using Bregman projections in a product space, Block-iterative surrogate projection methods for convex feasibility problems, A proximal point algorithm for minimax problems, Inhomogeneous turbulent field diagnostics by distance-dependent tomographic reconstruction techniques, Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems, An acceleration scheme for row projection methods, A parallel relaxation method for quadratic programming problems with interval constraints, Primal-dual row-action method for convex programming, Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines, A primal-dual iterative algorithm for a maximum likelihood estimation problem, A partial linearization method for the traffic assignment problem, On finitely convergent iterative methods for the convex feasibility problem, Unrestricted iterations of nonexpansive mappings in Hilbert space
