Pages that link to "Item:Q5827281"

The following pages link to The Relaxation Method for Linear Inequalities (Q5827281):

Displaying 50 items.

• Inexact subgradient methods with applications in stochastic programming (Q1315432) (← links)
• New iterative methods for linear inequalities (Q1321142) (← links)
• Surrogate methods for linear inequalities (Q1321147) (← links)
• New contraction methods for linear inequalities (Q1334912) (← links)
• A quadratic integer programming method for minimizing the mean squared deviation of completion times (Q1342085) (← links)
• About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. II (Q1347145) (← links)
• 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)
• 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)
• Smoothing methods for convex inequalities and linear complementarity problems (Q1924058) (← links)
• Relaxation methods for solving linear inequality systems: converging results (Q1939079) (← links)
• On Motzkin's method for inconsistent linear systems (Q1999709) (← links)
• Boundary point method and the Mann-Dotson algorithm for non-self mappings in Banach spaces (Q2002079) (← links)
• Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities (Q2044573) (← 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)
• 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)
• 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)
• A new method for solving conditioned maxima problems (Q2394210) (← links)
• A linearly convergent doubly stochastic Gauss-Seidel algorithm for solving linear equations and a certain class of over-parameterized optimization problems (Q2425182) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• On the Mann-type iteration and the convex feasibility problem (Q2468142) (← links)
• A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy (Q2472373) (← links)
• Iterative synthesis of threshold functions (Q2523343) (← links)
• The relaxation method for inconsistent systems of linear inequalities (the limit-point set) (Q2538771) (← links)
• Episodic associative memories (Q2563862) (← 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)