Subspace Barzilai-Borwein Gradient Method for Large-Scale Bound Constrained Optimization

Subspace Barzilai-Borwein Gradient Method for Large-Scale Bound Constrained Optimization An active set subspace Barzilai-Borwein gradient algorithm for large-scale bound constrained optimization is proposed. The active sets are estimated by an identification technique. The search direction consists of two parts: some of the components are simply defined; the other components are determined by the Barzilai-Borwein gradient method. In this work, a nonmonotone line search strategy that guarantees global convergence is used. Preliminary numerical results show that the proposed method is promising, and competitive with the well-known method SPG on a subset of bound constrained problems from CUTEr collection. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Applied Mathematics and Optimization Springer Journals

Subspace Barzilai-Borwein Gradient Method for Large-Scale Bound Constrained Optimization

Loading next page...
 
/lp/springer_journal/subspace-barzilai-borwein-gradient-method-for-large-scale-bound-zTN1Pe0ocO
Publisher
Springer-Verlag
Copyright
Copyright © 2008 by Springer Science+Business Media, LLC
Subject
Mathematics; Numerical and Computational Methods ; Mathematical Methods in Physics; Mathematical and Computational Physics; Systems Theory, Control; Calculus of Variations and Optimal Control; Optimization
ISSN
0095-4616
eISSN
1432-0606
D.O.I.
10.1007/s00245-008-9038-9
Publisher site
See Article on Publisher Site

Abstract

An active set subspace Barzilai-Borwein gradient algorithm for large-scale bound constrained optimization is proposed. The active sets are estimated by an identification technique. The search direction consists of two parts: some of the components are simply defined; the other components are determined by the Barzilai-Borwein gradient method. In this work, a nonmonotone line search strategy that guarantees global convergence is used. Preliminary numerical results show that the proposed method is promising, and competitive with the well-known method SPG on a subset of bound constrained problems from CUTEr collection.

Journal

Applied Mathematics and OptimizationSpringer Journals

Published: Oct 1, 2008

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off