Pages that link to "Item:Q5827280"
From MaRDI portal
The following pages link to The Relaxation Method for Linear Inequalities (Q5827280):
Displayed 50 items.
- About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I (Q1347165) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- The MIN PFS problem and piecewise linear model estimation (Q1348259) (← links)
- A proximal point algorithm for minimax problems (Q1371666) (← links)
- Entropic perturbation method for solving a system of linear inequalities (Q1612393) (← links)
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems (Q1630420) (← links)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization (Q1644014) (← links)
- A polynomial projection-type algorithm for linear programming (Q1667181) (← links)
- Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
- Solving conic systems via projection and rescaling (Q1683682) (← links)
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem (Q1686516) (← links)
- Convergence analysis of processes with valiant projection operators in Hilbert space (Q1706406) (← links)
- Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
- Envelope functions: unifications and further properties (Q1730819) (← links)
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems (Q1803652) (← links)
- A class of methods for solving large convex systems (Q1813379) (← links)
- A projection method for least-squares solutions to overdetermined systems of linear inequalities (Q1821512) (← links)
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems (Q1822907) (← links)
- The ellipsoid method and its implications (Q1835842) (← links)
- Geometrically convergent projection method in matrix games (Q1897450) (← links)
- A generalized subgradient method with relaxation step (Q1914075) (← links)
- Relaxation methods for solving linear inequality systems: converging results (Q1939079) (← links)
- Online multiple kernel classification (Q1945032) (← links)
- On Motzkin's method for inconsistent linear systems (Q1999709) (← links)
- A new Jacobi-type iteration method for solving M-matrix or nonnegative linear systems (Q2070160) (← links)
- An evolutionary algorithm for large margin classification (Q2098359) (← links)
- Randomized Kaczmarz for tensor linear systems (Q2114108) (← links)
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration (Q2149567) (← links)
- Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem (Q2176283) (← links)
- A new SOR-type iteration method for solving linear systems (Q2184915) (← links)
- Scalable parallel algorithm for solving non-stationary systems of linear inequalities (Q2206971) (← links)
- Iterative Fejér processes in ill-posed problems (Q2207572) (← links)
- Block sampling Kaczmarz-Motzkin methods for consistent linear systems (Q2230558) (← links)
- Ein Iterationsverfahren für lineare Ungleichungssysteme (Q2264534) (← links)
- Piecewise linear retractions by reflexion (Q2265339) (← links)
- Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces (Q2274154) (← links)
- A polynomial algorithm for convex quadratic optimization subject to linear inequalities (Q2297665) (← links)
- Lagrangian relaxation of the generic materials and operations planning model (Q2303321) (← links)
- An invariance principle for semimartingale reflecting Brownian motions in domains with piecewise smooth boundaries (Q2455064) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- On the Mann-type iteration and the convex feasibility problem (Q2468142) (← links)
- An algorithmic theory of learning: Robust concepts and random projection (Q2499543) (← links)
- Iterative synthesis of threshold functions (Q2523343) (← links)
- Three circle theorems in partial differential equations and applications to improperly posed problems (Q2523806) (← links)
- Perceptron type learning algorithms in nonseparable situations (Q2533132) (← links)
- The relaxation method for inconsistent systems of linear inequalities (the limit-point set) (Q2538771) (← links)
- Episodic associative memories (Q2563862) (← links)
- On the convergence of Gauss' alternating procedure in the method of the least squares (Q2626527) (← links)
- A new iterative method for solving non-square systems of linear equations (Q2628345) (← links)
- On the asymptotic behavior of some alternate smoothing series expansion iterative methods (Q2639624) (← links)