ePubs
The open archive for STFC research publications
Home
About ePubs
Content Policies
News
Help
Privacy/Cookies
Suggest an Enhancement
Contact ePubs
Full Record Details
Persistent URL
http://purl.org/net/epubs/work/40520
Record Status
Checked
Record Id
40520
Title
An iterative working-set method for large-scale non-convex quadratic programming
Contributors
N I M Gould
,
PL Toint
Abstract
We consider a working-set method for solving large-scale non-convex quadratic programming problems for which there is no requirement that the objective function be convex. The methods are iterative at two levels, one level relating to the selection of the current working set, and the second due to the method used to solve the equality-constrained problem for this working set. A pre-conditioned conjugate gradient method is used for this inner iteration, with the preconditioner chosen especially to ensure feasibility requirement persists. The well-known equivalence between the conjugate-gradient and Lanczos methods is exploited when finding directions of negative curvature. Details of an implementation - the Fortran 90 package QPA in the forthcoming GALAHAD library - are given
Organisation
CCLRC
,
CSE
,
CSE-NAG
Keywords
Funding Information
Related Research Object(s):
29567
Licence Information:
Language
English (EN)
Type
Details
URI(s)
Local file(s)
Year
Journal Article
Applied Numerical Mathematics 43, no. 1-2 (2002): 109-128.
doi:10.1016/S0168-9274(02)00120-4
2002
Showing record 1 of 1
Recent Additions
Browse Organisations
Browse Journals/Series
Login to add & manage publications and access information for OA publishing
Username:
Password:
Useful Links
Chadwick & RAL Libraries
SHERPA FACT
SHERPA RoMEO
SHERPA JULIET
Journal Checker Tool
Google Scholar