The Relaxation Method for Solving Systems of Linear Inequalities
From MaRDI portal
Cited in
(68)- On strata of degenerate polyhedral cones. I: Condition and distance to strata
- Conditioning of random conic systems under a general family of input distributions
- A primal-dual projection method for solving systems of linear inequalities
- An automatic relaxation method for solving interval linear inequalities
- On some optimization techniques in image reconstruction from projections
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
- Surrogate methods for linear inequalities
- 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
- Fixed points of polarity type operators
- Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach
- A class of methods for solving large convex systems
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- Geometrically convergent projection method in matrix games
- Error estimates and Lipschitz constants for best approximation in continuous function spaces
- Primal-dual row-action method for convex programming
- Piecewise linear retractions by reflexion
- Hildreth's algorithm with applications to soft constraints for user interface layout
- Central axes and peripheral points in high dimensional directional datasets
- Normality and modulability indices. I: Convex cones in normed spaces
- On the von Neumann and Frank-Wolfe algorithms with away steps
- Towards a deeper geometric, analytic and algorithmic understanding of margins
- On Chubanov's Method for Linear Programming
- Rescaled coordinate descent methods for linear programming
- Convergence of the cyclical relaxation method for linear inequalities
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- Variable metric relaxation methods, part II: The ellipsoid method
- On the non-polynomiality of the relaxation method for systems of linear inequalities
- A condition-based algorithm for solving polyhedral feasibility problems
- On highly eccentric cones
- The Kaczmarz algorithm, row action methods, and statistical learning algorithms
- Some preconditioners for systems of linear inequalities
- A data-independent distance to infeasibility for linear conic systems
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- scientific article; zbMATH DE number 7201317 (Why is no real title available?)
- Rescaling algorithms for linear conic feasibility
- A theory of complexity, condition, and roundoff
- Linear convergence of projection algorithms
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- Partial inverse of a monotone operator
- Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
- Computational relaxation method for modeling electrostatic systems with non-trivial geometries
- A simple polynomial-time rescaling algorithm for solving linear programs
- Obtuse cones and Gram matrices with non-negative inverse
- Conic version of Loewner-John ellipsoid theorem
- A deterministic rescaled perceptron algorithm
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
- Inradius and circumradius of various convex cones arising in applications
- Asymptotics for some proximal-like method involving inertia and memory aspects
- Finite convergence of a subgradient projections method with expanding controls
- Robust smoothed analysis of a condition number for linear programming
- Efficient randomized block Kaczmarz method for linear feasibility
- Convergence studies on block iterative algorithms for image reconstruction
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
- Polyhedral Newton-min algorithms for complementarity problems
- Condition number of a convex cone
- A Greedy Fixed-Point Method for Solving Variational Inequalities over the Fixed-Point Constraints
- Reflection-projection method for convex feasibility problems with an obtuse cone
- Extending linear relaxation for non-square matrices and soft constraints
- 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
- Nonnegative Moore--Penrose inverses of Gram operators
- A conjugate gradient algorithm for sparse linear inequalities
- Coverage processes on spheres and condition numbers for linear programming
- On properties of different notions of centers for convex cones
This page was built for publication: The Relaxation Method for Solving Systems of Linear Inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885509)
