Regularization and normal solutions of systems of linear equations and inequalities
DOI10.1134/S0081543815050090zbMath1335.90066OpenAlexW2188486109MaRDI QIDQ492280
A. I. Golikov, Yuri G. Evtushenko
Publication date: 20 August 2015
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0081543815050090
unconstrained optimizationdual problemquadratic functionpiecewise quadratic functiongeneralized Newton methodsystem of linear equationsregularized problemsystem of linear equations with nonnegativity constraints
Convex programming (90C25) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Newton method for linear optimization problems with inequality constraints
- A Newton method for linear programming
- Finding the projection of a given point on the set of solutions of a linear programming problem
- On the minimum norm solution of linear programs
- On quadratic and complete quadratic problems of convex programming
- Regression and the Moore-Penrose pseudoinverse
- Parallel implementation of Newton’s method for solving large-scale linear programs
- A finite newton method for classification
- Quadratic approximation of penalty functions for solving large-scale linear programs
This page was built for publication: Regularization and normal solutions of systems of linear equations and inequalities