Inexact Newton Method for Minimization of Convex Piecewise Quadratic Functions
From MaRDI portal
Publication:5114894
DOI10.1007/978-3-030-23436-2_10zbMath1442.65110arXiv1901.03245OpenAlexW2910953038MaRDI QIDQ5114894
A. I. Golikov, Igor E. Kaporin
Publication date: 29 June 2020
Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.03245
Computational methods for sparse matrices (65F50) Numerical optimization and variational techniques (65K10)
Related Items (1)
Uses Software
Cites Work
- A Newton method for linear programming
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- A class of iterative methods for finite element equations
- Projective-dual method for solving systems of linear equations with nonnegative variables
- Computing minimum norm solution of linear systems of equations by the generalized Newton method
- Truncated Newton type solver with application to grid untangling problem
- Parallel implementation of Newton’s method for solving large-scale linear programs
- On a Class of Nonlinear Equation Solvers Based on the Residual Norm Reduction over a Sequence of Affine Subspaces
- A finite newton method for classification
- Error norm estimation and stopping criteria in preconditioned conjugate gradient iterations
- Methods of conjugate gradients for solving linear systems
- Regularization of the barrier variational method of grid generation
- Unnamed Item
This page was built for publication: Inexact Newton Method for Minimization of Convex Piecewise Quadratic Functions
