Linearly Constrained Discrete I 1 Problems
From MaRDI portal
Publication:3894544
DOI10.1145/355921.355930zbMath0448.49017OpenAlexW2029855939MaRDI 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
Linear programming (90C05) Discrete-time control/observation systems (93C55) Existence theories in calculus of variations and optimal control (49J99)
Related Items
Coefficients of determination for least absolute deviation analysis, An algorithm for quantile smoothing splines, Theorems of the alternative and duality, An interior point algorithm for nonlinear quantile regression, Discontinuous piecewise linear optimization, A penalty linear programming method using reduced-gradient basis-exchange techniques, 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, Solving linear programming problems via linear minimax problems, COBS: qualitatively constrained smoothing via linear programming, A property of projection residuals with applications to concave regression, Computational Algorithms for Calculating Least Absolute Value and Chebyshev Estimates for Multiple Regression, A fast and efficient implementation of qualitatively constrained quantile smoothing splines, First- and second-order optimality conditions for piecewise smooth objective functions, A note on recent proposals for computing \(l_ 1\) estimates, 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, The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review, An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.
