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