Generalized subsampled Newton method for large-scale linear inequalities with Tikhonov regularization
From MaRDI portal
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A finite newton method for classification
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A modified finite Newton method for fast solution of large scale linear SVMs
- A new Tikhonov regularization method
- A Newton method for linear programming
- A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
- An introduction to matrix concentration inequalities
- An investigation of Newton-sketch and subsampled Newton methods
- Computing minimum norm solution of linear systems of equations by the generalized Newton method
- Coordinate descent method for large-scale L2-loss linear support vector machines
- Error estimates for linear systems with applications to regularization
- Exact and inexact subsampled Newton methods for optimization
- Extrapolation techniques for ill-conditioned linear systems
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Improved analysis of the subsampled randomized Hadamard transform
- Linear inequalities via least squares
- Minimization of \(SC^ 1\) functions and the Maratos effect
- Numerical Optimization
- On some optimization techniques in image reconstruction from projections
- On the inverse function theorem
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Sample size selection in optimization methods for machine learning
- Scalable parallel algorithm for solving non-stationary systems of linear inequalities
- Second-order stochastic optimization for machine learning in linear time
- Sub-sampled Newton methods
- SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Tikhonov Regularization and Total Least Squares
- Trust region Newton method for logistic regression
- User-friendly tail bounds for sums of random matrices
This page was built for publication: Generalized subsampled Newton method for large-scale linear inequalities with Tikhonov regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232577)
