Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
From MaRDI portal
Publication:4153546
DOI10.1137/0715015zbMath0376.65018OpenAlexW2011903764MaRDI QIDQ4153546
Andrew R. Conn, J. W. Sinclair, Richard H. Bartels
Publication date: 1978
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0715015
Related Items
On the superlinear convergence of a trust region algorithm for nonsmooth optimization, Nonlinear programming via an exact penalty function: Global analysis, Local search methods for \(\ell_{1}\)-minimization in frame based signal compression, Linear best approximation using a class of \(k\)-major \(l_ p\) norms, Weighted Median of the Data in Solving Least Absolute Deviations Problems, Application of growth functions in the prediction of live weight of domestic animals, On orthogonal linear \(\ell_1\) approximation, An algorithm for quantile smoothing splines, Reconstruction of blocky impedance profiles from normal-incidence reflection seismograms which are band-limited and miscalibrated, Degeneracy in the presence of roundoff errors, Theorems of the alternative and duality, Piecewise-linear programming: The compact (CPLP) algorithm, L1for the simple linear regression model, Automatic decrease of the penalty parameter in exact penalty function methods, An optimal subgradient algorithm with subspace search for costly convex optimization problems, A penalty linear programming method using reduced-gradient basis-exchange techniques, Robust estimation of parameter for fractal inverse problem, On the use of piecewise linear models in nonlinear programming, Computational experience with an algorithm for discrete \(L_ 1\) approximation, 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, Weighted median algorithms for \(L_ 1\) approximation, On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory, An active set method for general linear problem subject to box constraints, Pattern search method for discrete \(L_{1}\)-approximation, A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications, A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems, Linear best approximation using a class of polyhedral norms, A quadratically convergent method for minimizing a sum of euclidean norms, Error backpropagation using least absolute criterion, Computational Algorithms for Calculating Least Absolute Value and Chebyshev Estimates for Multiple Regression, Linear programming and \(\ell _ 1\) regression: A geometric interpretation, Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes, On conditions for optimality of the nonlinearl 1 problem, A Cooperative Recurrent Neural Network for Solving L1 Estimation Problems with General Linear Constraints, Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l1- and l∞-norms, Second-order conditions for an exact penalty function, Form error evaluation using \(L_1\)-approximation, A Base-Point Descent Algorithm For Solving The Linear l 1 Problem, Boundedness of adjoint bases of approximate spectral subspaces and of associated block reduced Resolvents, First- and second-order optimality conditions for piecewise smooth objective functions, A new LAD curve-fitting algorithm: Slightly overdetermined equation systems in \(L_ 1\), Approximation in normed linear spaces, An efficient algorithm for solving the discrete minisum problem, A method of synthesis of linear discriminant function in the case of nonseparability, Selected bibliography on degeneracy, The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review, Algorithms for unconstrained \(L_ 1\) simple linear regression, Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems, An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.
