New iterative methods for linear inequalities

DOI10.1007/BF00939954zbMath0793.90035OpenAlexW1966259407MaRDI QIDQ1321142

Katta G. Murty, Kai Yang

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00939954

zbMATH Keywords

parallel implementationsystems of linear inequalitiessequential implementationsurrogate constraint

Mathematics Subject Classification ID

Linear programming (90C05) Linear inequalities of matrices (15A39) Iterative numerical methods for linear systems (65F10)

Related Items

Geometry of optimal value functions with applications to redundancy in linear programming, Zhang neural networks for a set of linear matrix inequalities with time-varying coefficient matrix, ZNN for solving online time-varying linear matrix-vector inequality via equality conversion, Block-iterative surrogate projection methods for convex feasibility problems, Geometrically convergent projection method in matrix games, On the entropic regularization method for solving min-max problems with applications, Continuous and discrete zeroing dynamics models using JMP function array and design formula for solving time-varying Sylvester-transpose matrix inequality, A surrogate hyperplane Kaczmarz method for solving consistent linear equations, Solving time-varying linear inequalities by finite-time convergent zeroing neural networks, Projection methods for the linear split feasibility problems, Iterative method for solving the linear feasibility problem, Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems, Incomplete alternating projection method for large inconsistent linear systems, Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem, An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem, Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy, A superlinearly convergent projection algorithm for solving the convex inequality problem, Quasi-convex feasibility problems: subgradient methods and convergence rates, Solving time-varying nonlinear inequalities using continuous and discrete-time Zhang dynamics, Entropic perturbation method for solving a system of linear inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A simultaneous projections method for linear inequalities
• On some optimization techniques in image reconstruction from projections
• On relaxation methods for systems of linear inequalities
• New methods for linear inequalities
• Khachiyan’s algorithm for linear programming
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• The method of projections for finding the common point of convex sets
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities