A hybrid algorithm for solving linear inequalities in a least squares sense
From MaRDI portal
Publication:1014358
DOI10.1007/s11075-008-9218-3zbMath1165.65029OpenAlexW2167457738WikidataQ112879555 ScholiaQ112879555MaRDI QIDQ1014358
Publication date: 27 April 2009
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-008-9218-3
Newton's methodnumerical experimentshybrid algorithmEuclidean least deviation problemfixed matrix iterationsinconsistent systems of linear inequalities
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05)
Related Items
Best approximate solutions of inconsistent linear inequality systems, A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality, Continuous and discrete zeroing dynamics models using JMP function array and design formula for solving time-varying Sylvester-transpose matrix inequality, Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense, Different Zhang functions leading to different Zhang-dynamics models illustrated via time-varying reciprocal solving, The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simultaneous projections method for linear inequalities
- The \(\ell_1\) solution of linear inequalities
- A computational solution of the inverse problem in radiation-therapy treatment planning
- Algorithms for bound constrained quadratic programming problems
- New methods for linear inequalities
- A row relaxation method for large \(l_ 1\) problems
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- Bound constrained quadratic programming via piecewise quadratic functions
- Newton's method for linear inequality systems
- Arbitrary-norm separating plane
- An open question on cyclic relaxation
- The adventures of a simple algorithm
- The smallest correction of an inconsistent system of linear inequalities
- On linear infeasibility arising in intensity-modulated radiation therapy inverse planning
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- The distance between two convex sets
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- On Linear Restricted and Interval Least-Squares Problems
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Iterative Solution of Linear Programs
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- A relaxation method for reconstructing objects from noisy X-rays
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
- Algorithms for the regularization of ill-conditioned least squares problems
- A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- On computational aspects of bounded linear least squares problems
- Linear Least Squares with Bounds and Linear Constraints
- Solving Linear Inequalities in a Least Squares Sense
- A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds
- Linear and Nonlinear Separation of Patterns by Linear Programming
- The Convergence of Linear Stationary Iterative Processes for Solving Singular Unstructured Systems of Linear Equations
