Conic algorithms for unconstrained minimization with special consideration of problems with large sparse hessians: A summary of research performed
Technical Report
·
OSTI ID:5701041
This paper contains a brief description of research activities on conic algorithms for unconstrained minimization. Line search termination criteria and the rate of convergence for a certain class of conic algorithms are for sparse problems are discussed. (LSP)
- Research Organization:
- Washington State Univ., Pullman (USA). Dept. of Pure and Applied Mathematics
- DOE Contract Number:
- FG06-85ER25007
- OSTI ID:
- 5701041
- Report Number(s):
- DOE/ER/25007-T1; ON: DE88002549
- Country of Publication:
- United States
- Language:
- English
Similar Records
Conic algorithms for unconstrained minimization with special consideration of problems with large sparse hessians: A summary of activities during the period August 1, 1985-July 31, 1986
Unconstrained and constrained minimization, localization, and the Grassmann manifold: Theory and application to electronic structure
Unconstrained and Constrained Minimization, Linear Scaling, and the Grassmann Manifold: Theory and Applications
Technical Report
·
Wed Jan 01 00:00:00 EST 1986
·
OSTI ID:5701041
Unconstrained and constrained minimization, localization, and the Grassmann manifold: Theory and application to electronic structure
Journal Article
·
Mon Oct 15 00:00:00 EDT 2001
· Physical Review B
·
OSTI ID:5701041
+2 more
Unconstrained and Constrained Minimization, Linear Scaling, and the Grassmann Manifold: Theory and Applications
Journal Article
·
Wed Jul 19 00:00:00 EDT 2000
· Physical Review B
·
OSTI ID:5701041
+2 more