View in EDS

On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems.

Saved in:

Bibliographic Details
Title:	On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems.
Authors:	Cafieri, S.¹ sonia.cafieri@unina2.it, D'Apuzzo, M.¹ marco.dapuzzo@unina2.it, De Simone, V.¹ valentina.desimone@unina2.it, Di Serafino, D.¹ daniela.diserafino@unina2.it
Source:	Computational Optimization & Applications. Sep2007, Vol. 38 Issue 1, p27-45. 19p. 5 Charts.
Subjects:	Nonlinear programming, Quadratic programming, Algorithms, Mathematical optimization, Mathematical analysis, Mathematics
Abstract:	Iterative solvers appear to be very promising in the development of efficient software, based on Interior Point methods, for large-scale nonlinear optimization problems. In this paper we focus on the use of preconditioned iterative techniques to solve the KKT system arising at each iteration of a Potential Reduction method for convex Quadratic Programming. We consider the augmented system approach and analyze the behaviour of the Constraint Preconditioner with the Conjugate Gradient algorithm. Comparisons with a direct solution of the augmented system and with MOSEK show the effectiveness of the iterative approach on large-scale sparse problems. [ABSTRACT FROM AUTHOR]
	Copyright of Computational Optimization & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Be the first to leave a comment!