|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2009, Volume 49, Number 10, Pages 1785–1795
(Mi zvmmf4769)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Semismooth Newton method for quadratic programs with bound constraints
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:
Convex quadratic programs with bound constraints are proposed to be solved by applying a semismooth Newton method to the corresponding variational inequality. Computational experiments demonstrate that, for strongly convex problems, this approach can be considerably more efficient than more traditional approaches.
Key words:
quadratic program, variational inequality, mixed complementarity problem, complementarity function, natural residual, semismooth Newton method, active-set method, projected gradient method.
Received: 23.03.2009
Citation:
A. N. Daryina, A. F. Izmailov, “Semismooth Newton method for quadratic programs with bound constraints”, Zh. Vychisl. Mat. Mat. Fiz., 49:10 (2009), 1785–1795; Comput. Math. Math. Phys., 49:10 (2009), 1706–1716
Linking options:
https://www.mathnet.ru/eng/zvmmf4769 https://www.mathnet.ru/eng/zvmmf/v49/i10/p1785
|
|