A penalty continuation method for the \(\ell_\infty\) solution of overdetermined linear systems
From MaRDI portal
Publication:1387246
DOI10.1007/BF02510921zbMath1005.65061OpenAlexW2047360288MaRDI QIDQ1387246
Samir Elhedhli, Mustafa Çelebi Pinar
Publication date: 2 August 1998
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02510921
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Quadratic programming (90C20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems
- New characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equations
- Piecewise-linear pathways to the optimal solution set in linear programming
- Finite algorithms for robust linear regression
- An Exact Penalty Method for Constrained, Discrete, Linear $l_\infty $ Data Fitting
- An extended set of FORTRAN basic linear algebra subprograms
- Primal Methods are Better than Dual Methods for Solving Overdetermined Linear Systems in the $l_\infty $ Sense?
- A Global and Quadratically Convergent Method for Linear $l_\infty $ Problems
- On Cline’s Direct Method for Solving Overdetermined Linear Systems in the $L_\infty $ Sense
- A New Finite Continuation Algorithm for Linear Programming
- A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
- Numerical Analysis: Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equations
This page was built for publication: A penalty continuation method for the \(\ell_\infty\) solution of overdetermined linear systems
