Linearly Constrained Discrete I 1 Problems

DOI10.1145/355921.355930zbMath0448.49017MaRDI QIDQ3894544

Andrew R. Conn, Richard H. Bartels

Publication date: 1980

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/355921.355930

zbMATH Keywords

discrete approximation; linearly constrained approximation

Mathematics Subject Classification ID

90C05: Linear programming

93C55: Discrete-time control/observation systems

49J99: Existence theories in calculus of variations and optimal control

Related Items

Searching for a best least absolute deviations solution of an overdetermined system of linear equations motivated by searching for a best least absolute deviations hyperplane on the basis of given data, Coefficients of determination for least absolute deviation analysis, A penalty linear programming method using reduced-gradient basis-exchange techniques, Solving linear programming problems via linear minimax problems, A property of projection residuals with applications to concave regression, The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review, An algorithm for quantile smoothing splines, Theorems of the alternative and duality, Discontinuous piecewise linear optimization, 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., An interior point algorithm for nonlinear quantile regression, COBS: qualitatively constrained smoothing via linear programming, A note on recent proposals for computing \(l_ 1\) estimates, Computational Algorithms for Calculating Least Absolute Value and Chebyshev Estimates for Multiple Regression