The Relaxation Method for Linear Inequalities

Cited in

(only showing first 100 items - show all)

On the regularity condition in a convex feasibility problem
A primal-dual projection method for solving systems of linear inequalities
An automatic relaxation method for solving interval linear inequalities
Linear function neurons: Structure and training
Strong convergence of projection-like methods in Hilbert spaces
An LP-based successive overrelaxation method for linear complementarity problems
A computational solution of the inverse problem in radiation-therapy treatment planning
On some optimization techniques in image reconstruction from projections
Parallel application of block-iterative methods in medical imaging and radiation therapy
On approximate solutions of infinite systems of linear inequalities
A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
On relaxation methods for systems of linear inequalities
New methods for linear inequalities
An interior points algorithm for the convex feasibility problem
Projection algorithms for linear programming
Dynamics of cooperative games
Minimization methods with constraints
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
Orthogonalizing linear operators in convex programming. I, II
Inexact subgradient methods with applications in stochastic programming
New iterative methods for linear inequalities
Surrogate methods for linear inequalities
New contraction methods for linear inequalities
A quadratic integer programming method for minimizing the mean squared deviation of completion times
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 proximal point algorithm for minimax problems
Entropic perturbation method for solving a system of linear inequalities
Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
A polynomial projection-type algorithm for linear programming
Recent contributions to linear semi-infinite optimization
Solving conic systems via projection and rescaling
A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
Convergence analysis of processes with valiant projection operators in Hilbert space
Recent contributions to linear semi-infinite optimization: an update
Envelope functions: unifications and further properties
Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
A class of methods for solving large convex systems
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
The ellipsoid method and its implications
Geometrically convergent projection method in matrix games
A generalized subgradient method with relaxation step
Relaxation methods for solving linear inequality systems: converging results
Online multiple kernel classification
On Motzkin's method for inconsistent linear systems
A new Jacobi-type iteration method for solving M-matrix or nonnegative linear systems
An evolutionary algorithm for large margin classification
Randomized Kaczmarz for tensor linear systems
Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
A new SOR-type iteration method for solving linear systems
Scalable parallel algorithm for solving non-stationary systems of linear inequalities
Iterative Fejér processes in ill-posed problems
Block sampling Kaczmarz-Motzkin methods for consistent linear systems
Ein Iterationsverfahren für lineare Ungleichungssysteme
Piecewise linear retractions by reflexion
Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces
A polynomial algorithm for convex quadratic optimization subject to linear inequalities
Lagrangian relaxation of the generic materials and operations planning model
An invariance principle for semimartingale reflecting Brownian motions in domains with piecewise smooth boundaries
A survey on the continuous nonlinear resource allocation problem
On the Mann-type iteration and the convex feasibility problem
An algorithmic theory of learning: Robust concepts and random projection
Iterative synthesis of threshold functions
Three circle theorems in partial differential equations and applications to improperly posed problems
Perceptron type learning algorithms in nonseparable situations
The relaxation method for inconsistent systems of linear inequalities (the limit-point set)
Episodic associative memories
Generation of interior points and polyhedral representations of cones in R^N cut by M planes sharing a common point
On the convergence of Gauss' alternating procedure in the method of the least squares
A new iterative method for solving non-square systems of linear equations
On the asymptotic behavior of some alternate smoothing series expansion iterative methods
A note on the complex and bicomplex valued neural networks
An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem
On Chubanov's Method for Linear Programming
A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
Rate of convergence of a class of numerical methods solving linear inequality systems
Rescaled coordinate descent methods for linear programming
Single-projection procedure for linear optimization
Convergence of the cyclical relaxation method for linear inequalities
A general iterative scheme with applications to convex optimization and related fields
Projection methods: an annotated bibliography of books and reviews
On the behavior of a block-iterative projection method for solving convex feasibility problems
Block-iterative algorithms
Cycle-based reducibility of multi-index transport-type systems of linear inequalities
Randomly generated polytopes for testing mathematical programming algorithms
Variable metric relaxation methods, part II: The ellipsoid method
A class of convergent primal-dual subgradient algorithms for decomposable convex programs
A generalization of Polyak's convergence result for subgradient optimization
Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual
On the non-polynomiality of the relaxation method for systems of linear inequalities
Convergence of a cyclic ellipsoid algorithm for systems of linear equalities
Modifications and implementation of the ellipsoid algorithm for linear programming
Subgradient optimization applied to a discrete nonlinear problem in engineering design
Ein Iterationsverfahren zur Berechnung nichtnegativer Lösungen eines linearen Gleichungssystems
Strong convergence of the mann iteration for -demicontractive mappings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5827280)