Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems
From MaRDI portal
Publication:1321337
DOI10.1007/BF00940715zbMath0796.49029OpenAlexW2075403875MaRDI QIDQ1321337
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/bf00940715
quadratic convergenceoverdetermined linear systemsuperlinear convergence rate\(l_ \infty\)-solution\(l_ 1\)-solutionprimal-dual interior point approach
Related Items
Multiple criteria linear regression, Least absolute deviations estimation for uncertain regression with imprecise observations, A penalty continuation method for the \(\ell_\infty\) solution of overdetermined linear systems, An entropy regularization technique for minimizing a sum of Tchebycheff norms, Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem., Loss and retention of accuracy in affine scaling methods, On a class of interval predictor models with universal reliability, Distributionally robust \(L_1\)-estimation in multiple linear regression, Approximation in normed linear spaces, The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors, An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.
Cites Work
- Unnamed Item
- Unnamed Item
- Computational experience with a primal-dual interior point method for linear programming
- A least-squares-based method for a class of nonsmooth minimization problems with applications in plasticity
- Interior path following primal-dual algorithms. I: Linear programming
- On finding a vertex solution using interior point methods
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- Column Relaxation Methods for Least Norm Problems
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Further Development of a Primal-Dual Interior Point Method
- Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method
- An Improved Algorithm for Discrete $l_1 $ Linear Approximation
