The Relaxation Method for Linear Inequalities
From MaRDI portal
Publication:5827280
DOI10.4153/CJM-1954-037-2zbMath0055.35001WikidataQ105835747 ScholiaQ105835747MaRDI QIDQ5827280
Publication date: 1954
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
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, Decentralized multi-agent optimization based on a penalty method, A class of convergent primal-dual subgradient algorithms for decomposable convex programs, Rescaled Coordinate Descent Methods for Linear Programming, Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations, 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, The traveling-salesman problem and minimum spanning trees: Part II, Approximate Solutions of Linear Systems at a Universal Rate, A generalization of Polyak's convergence result for subgradient optimization, Randomized Block Adaptive Linear System Solvers, On Chubanov's Method for Linear Programming, The use of additional diminishing disturbances in Fejer models of iterative algorithms, Fejér-type iterative processes in the constrained quadratic minimization problem, Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition, Rescaling Algorithms for Linear Conic Feasibility, A note on the complex and bicomplex valued neural networks, An iterative method, having linear rate of convergence, for solving a pair of dual linear programs, A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility, Ein Iterationsverfahren zur Berechnung nichtnegativer Lösungen eines linearen Gleichungssystems, Unnamed Item, Application of the Finite Inclusions Theorem to robust analysis and synthesis, On a problem of reserves controlin the presence of an interference, Block‐iterative algorithms, A simple polynomial-time rescaling algorithm for solving linear programs, 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, 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, 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, A weighted randomized Kaczmarz method for solving linear systems, Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes, Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, The cluster set of a nonexpansive mapping, Rate of convergence of a class of numerical methods solving linear inequality systems, An Implicit Representation and Iterative Solution of Randomly Sketched 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, Method of Alternating Contractions and Its Applications to Some Convex Optimization Problems, Variable metric relaxation methods, part II: The ellipsoid method, Validation of subgradient optimization, New contraction methods for linear inequalities, On the convergence of Gauss' alternating procedure in the method of the least squares, 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, An algorithmic theory of learning: robust concepts and random projection, On the asymptotic behavior of some alternate smoothing series expansion iterative methods, Single-projection procedure for linear optimization, On some optimization techniques in image reconstruction from projections, Parallel application of block-iterative methods in medical imaging and radiation therapy, Cycle-based reducibility of multi-index transport-type systems of linear inequalities, A proximal point algorithm for minimax problems, A generalized subgradient method with relaxation step, A polynomial projection-type algorithm for linear programming, On approximate solutions of infinite systems of linear inequalities, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem, Recent contributions to linear semi-infinite optimization, Multiindex optimal production planning problems, A new SOR-type iteration method for solving linear systems, Solving conic systems via projection and rescaling, A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem, Strong convergence of the mann iteration for -demicontractive mappings, Relaxation methods for solving linear inequality systems: converging results, Online multiple kernel classification, 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, Recent contributions to linear semi-infinite optimization: an update, An invariance principle for semimartingale reflecting Brownian motions in domains with piecewise smooth boundaries, Envelope functions: unifications and further properties, A survey on the continuous nonlinear resource allocation problem, 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, On the Mann-type iteration and the convex feasibility problem, Hilbertian convex feasibility problem: Convergence of projection methods, 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, Coverage processes on spheres and condition numbers for linear programming, Iterative methods for the computation of fixed points of demicontractive mappings, Ein Iterationsverfahren für lineare Ungleichungssysteme, 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, An algorithmic theory of learning: Robust concepts and random projection, Dynamics of cooperative games, Minimization methods with constraints, 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, Extending linear relaxation for non-square matrices and soft constraints, 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, Three circle theorems in partial differential equations and applications to improperly posed problems, A polynomial projection algorithm for linear feasibility problems, Lagrangian relaxation of the generic materials and operations planning model, On the convergence properties of Hildreth's quadratic programming algorithm, Perceptron type learning algorithms in nonseparable situations, 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, A new Jacobi-type iteration method for solving M-matrix or nonnegative linear systems, The ellipsoid method and its implications, Episodic associative memories, A primal-dual projection method for solving systems of linear inequalities, An evolutionary algorithm for large margin classification, An automatic relaxation method for solving interval linear inequalities, Inexact subgradient methods with applications in stochastic programming, Linear function neurons: Structure and training, 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
