The Relaxation Method for Linear Inequalities

Related Items (only showing first 100 items - show all)

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

This page was built for publication: The Relaxation Method for Linear Inequalities