A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems

A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems (1999)

by Mary Ann Branch , Thomas F. Coleman , And Yuying Li , Yuying Li

Venue:	SIAM Journal on Scientific Computing
Citations:	27 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems	user correction - Legacy Corrections
AUTHOR NAME	Mary Ann Branch	user correction - Legacy Corrections
AUTHOR NAME	Thomas F. Coleman	user correction - Legacy Corrections
AUTHOR NAME	And Yuying Li	user correction - Legacy Corrections
AUTHOR NAME	Yuying Li	user correction - Legacy Corrections
ABSTRACT	A subspace adaptation of the Coleman-Li trust region and interior method is proposed for solving large-scale bound-constrained minimization problems. This method can be implemented with either sparse Cholesky factorization or conjugate gradient computation. Under reasonable conditions the convergence properties of this subspace trust region method are as strong as those of its full-space version.	user correction - Legacy Corrections
YEAR	1999	INFERENCE
VENUE	SIAM Journal on Scientific Computing	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
PAGES	1--23	INFERENCE
VOLUME	21	INFERENCE
TECH	Tech. Rep. CTC95TR217	INFERENCE
CITATIONS	15 found	ParsCit 1.0