Successive Element Correction Algorithms for Sparse Unconstrained Optimization

Simple item page
dc.contributor.authorLi, Guangyeen_US
dc.date.accessioned2018-06-18T17:30:47Zen_US
dc.date.available2018-06-18T17:30:47Zen_US
dc.date.issued1991-10en_US
dc.date.noteOctober 1991en_US
dc.description.abstractThis paper presents a successive element correction algorithm and a secant modification of this algorithm. The new algorithms are designed to use the gradient evaluations as efficiently as possible in forming the approximate Hessian. The estimate of the q-convergence and r-convergence rates show that the new algorithms may have good local convergence properties. Some restricted numerical results and comparisons with some previously established algorithms suggest the new algorithms have some promise to be efficient in practice.en_US
dc.format.extent19 ppen_US
dc.identifier.citationLi, Guangye. "Successive Element Correction Algorithms for Sparse Unconstrained Optimization." (1991) <a href="https://hdl.handle.net/1911/101735">https://hdl.handle.net/1911/101735</a>.en_US
dc.identifier.digitalTR91-34en_US
dc.identifier.urihttps://hdl.handle.net/1911/101735en_US
dc.language.isoengen_US
dc.titleSuccessive Element Correction Algorithms for Sparse Unconstrained Optimizationen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR91-34.pdf
Size:
276.9 KB
Format:
Adobe Portable Document Format
Download
Collections
CMOR Technical Reports