scientific article; zbMATH DE number 3915531
From MaRDI portal
Publication:3690974
data analysisdescent methodsdiscrete approximationleast squares regressionnon-differentiable convex programmingpolyhedral convex programmingscalingsimplex methodsubgradient methodstextbook
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Linear regression; mixed models (62J05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical smoothing, curve fitting (65D10) Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Linear programming (90C05) Convex programming (90C25)
Recommendations
Cited in
(79)- Sensitivity analysis of constrained linear \(L_1\) regression: Perturbations to constraints, addition and deletion of observations
- Distance regression by Gauss-Newton-type methods and iteratively re-weighted least-squares
- On the solution of highly degenerate linear programmes
- Linear programming via least squares
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
- Linear best approximation using a class of polyhedral norms
- The `lethargy' theorem - a property of approximation by \(\gamma\)- polynomials
- A practical anti-cycling procedure for linearly constrained optimization
- A new neural network for solving linear programming problems
- 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
- Methods of calculating \(l_ p\)-minimum norm solutions of consistent linear systems
- LAD regression for detecting outliers in response and explanatory variables
- Theorems of the alternative and duality
- A proximal point algorithm for minimax problems
- Discontinuous piecewise linear optimization
- Convergence behavior of an iterative reweighting algorithm to compute multivariate M-estimates for location and scatter
- 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
- An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.
- Broken adaptive ridge regression and its asymptotic properties
- The geometry of basic, approximate, and minimum-norm solutions of linear equations
- An inexact algorithm for composite nondifferentiable optimization
- A note on the statistical properties of the secant algorithm for calculating rank estimators
- Finding normal solutions in piecewise linear programming
- Error estimates and Lipschitz constants for best approximation in continuous function spaces
- A method of Euclidean centers
- Incremental method for multiple line detection problem -- iterative reweighted approach
- A Laplacian approach to _1-norm minimization
- Robustness by reweighting for kernel estimators: an overview
- Iteratively reweighted least squares and slime mold dynamics: connection and convergence
- Data loci in algebraic optimization
- Incorporating LASSO effects into a mixed model for quantitative trait loci detection
- Nonlinear programming and nonsmooth optimization by successive linear programming
- A resilient domain decomposition polynomial chaos solver for uncertain elliptic PDEs
- An algorithm for fitting circular arcs to data using the \(l_1\) norm
- The distance between two convex sets
- Adaptive methods for solvings minimax problems∗
- Loss and retention of accuracy in affine scaling methods
- Discrete a priori bounds for the detection of corrupted PDE solutions in exascale computations
- Nonlinear residual minimization by iteratively reweighted least squares
- Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines
- Conjugate gradient acceleration of iteratively re-weighted least squares methods
- Heuristic discrepancy principle for variational regularization of inverse problems
- Estimation of Polygons and Areas
- The influence function of penalized regression estimators
- Iteratively reweighted least squares minimization for sparse recovery
- Local properties of algorithms for minimizing nonsmooth composite functions
- A simple algebraic proof of Farkas's lemma and related theorems
- Convergence Behavior of the em algorithm for the multivariate t -distribution
- Semi-parametric MLE in Simple Linear Regression Analysis with Interval-Censored Data
- scientific article; zbMATH DE number 7246283 (Why is no real title available?)
- An algorithm for real and complex rational minimax approximation
- Quasi-linear compressed sensing
- Numerical Linear Approximation in C
- The best least absolute deviations line -- properties and two efficient methods for its derivation
- Robust Bayesian Regression Analysis Using Ramsay-Novick Distributed Errors with Student-t Prior
- A primal-dual algorithm for minimizing a sum of Euclidean norms
- An update-and-stabilize framework for the minimum-norm-point problem
- Numerical algorithms for estimation and calculation of parameters in modeling pest population dynamics and evolution of resistance
- Cardinality minimization, constraints, and regularization: a survey
- Iteratively reweighted least squares for phase unwrapping
- Cauchy graph convolutional networks
- Robust regression analysis using the weighted median model for improved denoising of MR data in image processing
- On the Wasserstein Median of Probability Measures
- Fast algorithms for _p-regression
- A general formulation of reweighted least squares fitting
- R-estimation in linear models: algorithms, complexity, challenges
- An update-and-stabilize framework for the minimum-norm-point problem
- The sagitta method for solving linear programs
- Smoothing methods for nonsmooth, nonconvex minimization
- Interpretable Model Summaries Using the Wasserstein Distance
- Three points method for searching the best least absolute deviations plane
- Estimating the matrix p-norm
- On Hoffman's celebrated cycling LP example
- Smoothing Newton method for minimizing the sum of \(p\) -norms
- Sensitivity analysis of constrained linear L₁ regression: perturbations to response and predictor variables
- Computation of Huber's \(M\)-estimates for a block-angular regression problem
- When do stepwise algorithms meet subset selection criteria?
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3690974)
