New iterative methods for linear inequalities
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- scientific article; zbMATH DE number 3232960 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A simultaneous projections method for linear inequalities
- Khachiyan’s algorithm for linear programming
- New methods for linear inequalities
- On relaxation methods for systems of linear inequalities
- On some optimization techniques in image reconstruction from projections
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The method of projections for finding the common point of convex sets
Cited in
(29)- An automatic relaxation method for solving interval linear inequalities
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
- Projection methods for the linear split feasibility problems
- Incomplete alternating projection method for large inconsistent linear systems
- scientific article; zbMATH DE number 16987 (Why is no real title available?)
- New contraction methods for linear inequalities
- scientific article; zbMATH DE number 3945874 (Why is no real title available?)
- ZNN for solving online time-varying linear matrix-vector inequality via equality conversion
- scientific article; zbMATH DE number 4189102 (Why is no real title available?)
- A surrogate hyperplane Kaczmarz method for solving consistent linear equations
- Iterative method for solving the linear feasibility problem
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem
- Continuous and discrete zeroing dynamics models using JMP function array and design formula for solving time-varying Sylvester-transpose matrix inequality
- Scalable parallel algorithm for solving non-stationary systems of linear inequalities
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
- Block-iterative surrogate projection methods for convex feasibility problems
- On the entropic regularization method for solving min-max problems with applications
- Geometry of optimal value functions with applications to redundancy in linear programming
- Entropic perturbation method for solving a system of linear inequalities
- Zhang neural networks for a set of linear matrix inequalities with time-varying coefficient matrix
- Solving time-varying nonlinear inequalities using continuous and discrete-time Zhang dynamics
- Geometrically convergent projection method in matrix games
- Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
- Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem
- Solving time-varying linear inequalities by finite-time convergent zeroing neural networks
- scientific article; zbMATH DE number 1788243 (Why is no real title available?)
- A simultaneous projections method for linear inequalities
- A superlinearly convergent projection algorithm for solving the convex inequality problem
- Quasi-convex feasibility problems: subgradient methods and convergence rates
This page was built for publication: New iterative methods for linear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321142)
