RUS  ENG
Full version
JOURNALS // Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki // Archive

Zh. Vychisl. Mat. Mat. Fiz., 2019 Volume 59, Number 12, Pages 2086–2101 (Mi zvmmf10999)

This article is cited in 1 paper

Newton-type method for solving systems of linear equations and inequalities

A. I. Golikovab, Yu. G. Evtushenkoab, I. E. Kaporinab

a Federal Research Center "Computer Science and Control" of Russian Academy of Sciences
b Moscow Institute of Physics and Technology (State University)

Abstract: A Newton-type method is proposed for numerical minimization of convex piecewise quadratic functions, and its convergence is analyzed. Previously, a similar method was successfully applied to optimization problems arising in mesh generation. It is shown that the method is applicable to computing the projection of a given point onto the set of nonnegative solutions of a system of linear equations and to determining the distance between two convex polyhedra. The performance of the method is tested on a set of problems from the NETLIB repository.

Key words: systems of linear equations and inequalities, regularization, penalty function method, duality, projection of a point, piecewise quadratic function, Newton’s method, preconditioned conjugate gradient method.

UDC: 7.977

Received: 27.06.2019
Revised: 27.06.2019
Accepted: 05.08.2019

DOI: 10.1134/S0044466919120093


 English version:
Computational Mathematics and Mathematical Physics, 2019, 59:12, 2017–2032

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024