Kearsley, A.
(2006),
A Matrix-Free Algorithm for the Large-Scale Constrained Trust-Region Subproblem, Optimization Methods and Software, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=50695
(Accessed December 7, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
A Matrix-Free Algorithm for the Large-Scale Constrained Trust-Region Subproblem
Published
Author(s)
Abstract
A new matrix-free algorithm for the solution of linear inequality constrained, large-scale trust-region sub-problems is presented. The matrix-free nature of the algorithm eliminates the need for any matrix factorizations and only requires inner products between vectors and rows/columns of matrices. Numerical results that demonstrate the viability of the approach are included.Citation
Optimization Methods and Software
Volume
2
Pub Type
Journals
Download Paper
Keywords
constrained quadratic optimization, lanczos method, regularization, trust region
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created April 28, 2006, Updated February 17, 2017