scientific article

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

textbook scaling data analysis discrete approximation simplex method least squares regression subgradient methods descent methods non-differentiable convex programming polyhedral convex programming

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Linear regression; mixed models (62J05) Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Methods of calculating \(l_ p\)-minimum norm solutions of consistent linear systems, Nonlinear residual minimization by iteratively reweighted least squares, Semi-parametric MLE in Simple Linear Regression Analysis with Interval-Censored Data, Conjugate gradient acceleration of iteratively re-weighted least squares methods, A note on the statistical properties of the secant algorithm for calculating rank estimators, Iteratively reweighted least squares and slime mold dynamics: connection and convergence, Finding normal solutions in piecewise linear programming, The influence function of penalized regression estimators, Error estimates and Lipschitz constants for best approximation in continuous function spaces, On the solution of highly degenerate linear programmes, A method of Euclidean centers, LAD regression for detecting outliers in response and explanatory variables, Theorems of the alternative and duality, Linear programming via least squares, A proximal point algorithm for minimax problems, On Hoffman's celebrated cycling LP example, Discontinuous piecewise linear optimization, A resilient domain decomposition polynomial chaos solver for uncertain elliptic PDEs, Discrete A Priori Bounds for the Detection of Corrupted PDE Solutions in Exascale Computations, An update-and-stabilize framework for the minimum-norm-point problem, Convergence Behavior of the em algorithm for the multivariate t -distribution, Convergence behavior of an iterative reweighting algorithm to compute multivariate M-estimates for location and scatter, Numerical algorithms for estimation and calculation of parameters in modeling pest population dynamics and evolution of resistance, An Algorithm for Real and Complex Rational Minimax Approximation, Heuristic discrepancy principle for variational regularization of inverse problems, Smoothing Newton method for minimizing the sum of \(p\) -norms, Sensitivity analysis of constrained linear \(L_1\) regression: perturbations to response and predictor variables, A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems, Linear best approximation using a class of polyhedral norms, Computation of Huber's \(M\)-estimates for a block-angular regression problem, An algorithm for fitting circular arcs to data using the \(l_1\) norm, Incremental method for multiple line detection problem -- iterative reweighted approach, A simple algebraic proof of Farkas's lemma and related theorems, Incorporating LASSO effects into a mixed model for quantitative trait loci detection, Adaptive methods for solvings minimax problems^∗, The sagitta method for solving linear programs, The `lethargy' theorem - a property of approximation by \(\gamma\)- polynomials, Loss and retention of accuracy in affine scaling methods, The distance between two convex sets, Smoothing methods for nonsmooth, nonconvex minimization, Nonlinear programming and nonsmooth optimization by successive linear programming, A primal-dual algorithm for minimizing a sum of Euclidean norms, When do stepwise algorithms meet subset selection criteria?, Broken adaptive ridge regression and its asymptotic properties, Three points method for searching the best least absolute deviations plane, A Laplacian approach to \(\ell_1\)-norm minimization, Sensitivity analysis of constrained linear \(L_1\) regression: Perturbations to constraints, addition and deletion of observations, The geometry of basic, approximate, and minimum-norm solutions of linear equations, A practical anti-cycling procedure for linearly constrained optimization, A new neural network for solving linear programming problems, An inexact algorithm for composite nondifferentiable optimization, Distance regression by Gauss-Newton-type methods and iteratively re-weighted least-squares, Robustness by reweighting for kernel estimators: an overview, Iteratively reweighted least squares minimization for sparse recovery, Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines, THE BEST LEAST ABSOLUTE DEVIATIONS LINE – PROPERTIES AND TWO EFFICIENT METHODS FOR ITS DERIVATION, Quasi-linear Compressed Sensing, 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, The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review, On degeneracy in linear programming and related problems, Robust Bayesian Regression Analysis Using Ramsay-Novick Distributed Errors with Student-t Prior, Estimation of Polygons and Areas, Local properties of algorithms for minimizing nonsmooth composite functions, Estimating the matrix \(p\)-norm, An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.