The Relaxation Method for Linear Inequalities

DOI10.4153/CJM-1954-038-xzbMath0055.35002WikidataQ29999483 ScholiaQ29999483MaRDI QIDQ5827281

I. J. Schoenberg, Theodore S. Motzkin

Publication date: 1954

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

numerical analysis

Related Items

A Deterministic Kaczmarz Algorithm for Solving Linear Systems, Subgradient optimization applied to a discrete nonlinear problem in engineering design, Projection methods: an annotated bibliography of books and reviews, Stochastic block projection algorithms with extrapolation for convex feasibility problems, A class of convergent primal-dual subgradient algorithms for decomposable convex programs, On finitely convergent iterative methods for the convex feasibility problem, Rescaled Coordinate Descent Methods for Linear Programming, Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations, On greedy randomized block Kaczmarz method for consistent linear systems, Iterations of parallel convex projections in hilbert spaces, On the behavior of a block-iterative projection method for solving convex feasibility problems, Strong convergence of expected-projection methods in hilbert spaces, Can linear superiorization be useful for linear optimization problems?, The traveling-salesman problem and minimum spanning trees: Part II, Approximate Solutions of Linear Systems at a Universal Rate, Convex optimization-based structure-preserving filter for multidimensional finite element simulations, A generalization of Polyak's convergence result for subgradient optimization, Randomized Block Adaptive Linear System Solvers, On maximum residual nonlinear Kaczmarz-type algorithms for large nonlinear systems of equations, On Chubanov's Method for Linear Programming, On pseudoinverse-free block maximum residual nonlinear Kaczmarz method for solving large-scale nonlinear system of equations, The use of additional diminishing disturbances in Fejer models of iterative algorithms, Fejér-type iterative processes in the constrained quadratic minimization problem, A relaxation method for reconstructing objects from noisy X-rays, Rescaling Algorithms for Linear Conic Feasibility, A note on the complex and bicomplex valued neural networks, Splitting-based randomized iterative methods for solving indefinite least squares problem, A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility, Randomized block subsampling Kaczmarz-Motzkin method, Unnamed Item, Application of the Finite Inclusions Theorem to robust analysis and synthesis, Boundary Point Method and Mann-Dotson’s Algorithm for Nonself Strict Pseudo-contractive Mappings in Uniformly Smooth Banach Spaces, On a problem of reserves controlin the presence of an interference, Block‐iterative algorithms, Mathematical optimization in intensity modulated radiation therapy, Mathematical optimization in intensity modulated radiation therapy, The complexity of linear programming, A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space, Linear complementarity problems solvable by A single linear program, An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem, Convergence of the cyclical relaxation method for linear inequalities, On convergence rates of subgradient optimization methods, Computation and applications of the Newton polyhedrons, The Kaczmarz algorithm, row action methods, and statistical learning algorithms, A general iterative scheme with applications to convex optimization and related fields, A deterministic rescaled perceptron algorithm, Affinity propagation and uncapacitated facility location problems, Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes, Solving linear algebraic equations can be interesting, The cluster set of a nonexpansive mapping, Rate of convergence of a class of numerical methods solving linear inequality systems, Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates, An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems, On Adaptive Sketch-and-Project for Solving Linear Systems, Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin, On the non-polynomiality of the relaxation method for systems of linear inequalities, Randomly generated polytopes for testing mathematical programming algorithms, Motivation for working in numerical analysis, Convergence of a cyclic ellipsoid algorithm for systems of linear equalities, Modifications and implementation of the ellipsoid algorithm for linear programming, Polynomial algorithms for a class of linear programs, Variable metric relaxation methods, part II: The ellipsoid method, Validation of subgradient optimization, Convex Sets and Nearest Points. II, Generalized Gearhart-Koshy acceleration for the Kaczmarz method, New contraction methods for linear inequalities, Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems, Strong convergence of projection-like methods in Hilbert spaces, A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space, A quadratic integer programming method for minimizing the mean squared deviation of completion times, A new iterative method for solving non-square systems of linear equations, An LP-based successive overrelaxation method for linear complementarity problems, About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. II, About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I, Block-iterative surrogate projection methods for convex feasibility problems, The MIN PFS problem and piecewise linear model estimation, A computational solution of the inverse problem in radiation-therapy treatment planning, Geometrically convergent projection method in matrix games, Computational efficiency of the simplex embedding method in convex nondifferentiable optimization, Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration, On the asymptotic behavior of some alternate smoothing series expansion iterative methods, Single-projection procedure for linear optimization, A finitely convergent ``row-action method for the convex feasibility problem, On some optimization techniques in image reconstruction from projections, A new method for solving conditioned maxima problems, Parallel application of block-iterative methods in medical imaging and radiation therapy, A proximal point algorithm for minimax problems, A generalized subgradient method with relaxation step, A polynomial projection-type algorithm for linear programming, Multicriterial multi-index resource scheduling problems, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem, Smoothing methods for convex inequalities and linear complementarity problems, Recent contributions to linear semi-infinite optimization, Minimax forecasting model in the control system with identifier, Multiindex optimal production planning problems, Solving conic systems via projection and rescaling, Strong convergence of the mann iteration for -demicontractive mappings, Relaxation methods for solving linear inequality systems: converging results, A linearly convergent doubly stochastic Gauss-Seidel algorithm for solving linear equations and a certain class of over-parameterized optimization problems, On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints, The equity constrained shortest path problem, Convergence analysis of processes with valiant projection operators in Hilbert space, Scalable parallel algorithm for solving non-stationary systems of linear inequalities, Iterative Fejér processes in ill-posed problems, On relaxation methods for systems of linear inequalities, New methods for linear inequalities, An interior points algorithm for the convex feasibility problem, The ellipsoid method and its consequences in combinatorial optimization, Recent contributions to linear semi-infinite optimization: an update, Envelope functions: unifications and further properties, A survey on the continuous nonlinear resource allocation problem, Modified Newton-type processes generating Fejér approximations of regularized solutions to nonlinear equations, Block sampling Kaczmarz-Motzkin methods for consistent linear systems, A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem, Optimal partitioning of a data set based on the \(p\)-median model, Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems, Training spatially homogeneous fully recurrent neural networks in eigenvalue space., On the Mann-type iteration and the convex feasibility problem, Hilbertian convex feasibility problem: Convergence of projection methods, A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy, Projection algorithms for linear programming, A row relaxation method for large minimax problems, On Motzkin's method for inconsistent linear systems, A relaxation method for solving systems with infinitely many linear inequalities, Boundary point method and the Mann-Dotson algorithm for non-self mappings in Banach spaces, Coverage processes on spheres and condition numbers for linear programming, Iterative methods for the computation of fixed points of demicontractive mappings, Reflection-projection method for convex feasibility problems with an obtuse cone, Piecewise linear retractions by reflexion, A strongly polynomial algorithm for linear systems having a binary solution, Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces, Minimization methods with constraints, Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems, A generalized projection-based scheme for solving convex constrained optimization problems, Partial inverse of a monotone operator, On the regularity condition in a convex feasibility problem, Iterative processes of Fejér type in ill-posed problems with a priori information, Extending linear relaxation for non-square matrices and soft constraints, Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities, Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, Iterative synthesis of threshold functions, A polynomial algorithm for convex quadratic optimization subject to linear inequalities, A polynomial projection algorithm for linear feasibility problems, On the convergence properties of Hildreth's quadratic programming algorithm, Relaxed outer projections, weighted averages and convex feasibility, A class of methods for solving large convex systems, Linear dynamic approximation theory, The relaxation method for inconsistent systems of linear inequalities (the limit-point set), A projection method for least-squares solutions to overdetermined systems of linear inequalities, Block-iterative projection methods for parallel computation of solutions to convex feasibility problems, Orthogonalizing linear operators in convex programming. I, II, The ellipsoid method and its implications, Episodic associative memories, Arbitrary-norm separating plane, A primal-dual projection method for solving systems of linear inequalities, On the convergence of von Neumann's alternating projection algorithm for two sets, An automatic relaxation method for solving interval linear inequalities, Inexact subgradient methods with applications in stochastic programming, Randomized Kaczmarz for tensor linear systems, New iterative methods for linear inequalities, Surrogate methods for linear inequalities, Generation of interior points and polyhedral representations of cones in \(\mathbb R^N\) cut by \(M\) planes sharing a common point, Entropic perturbation method for solving a system of linear inequalities