|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2012, Volume 52, Number 4, Pages 602–613
(Mi zvmmf9680)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
On active-set methods for the quadratic programming problem
A. N. Daryinaa, A. F. Izmailovb a Dorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119333 Russia
b Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119992 Russia
Abstract:
The active-set Newton method developed earlier by the authors for mixed complementarity problems is applied to solving the quadratic programming problem with a positive definite matrix of the objective function. A theoretical justification is given to the fact that the method is guaranteed to find the exact solution in a finite number of steps. Numerical results indicate that this approach is competitive with other available methods for quadratic programming problems.
Key words:
quadratic programming problem, active-set method, semismooth Newton method, Fisher–Burmeister function.
Received: 18.10.2011
Citation:
A. N. Daryina, A. F. Izmailov, “On active-set methods for the quadratic programming problem”, Zh. Vychisl. Mat. Mat. Fiz., 52:4 (2012), 602–613; Comput. Math. Math. Phys., 52:4 (2012), 512–523
Linking options:
https://www.mathnet.ru/eng/zvmmf9680 https://www.mathnet.ru/eng/zvmmf/v52/i4/p602
|
|