Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
SIAM Journal on Numerical Analysis
Article . 1987 . Peer-reviewed
Data sources: Crossref
versions View all 2 versions
addClaim

Quasi-Newton Updates with Bounds

Quasi-Newton updates with bounds
Authors: Calamai, Paul H.; Moré, Jorge J.;

Quasi-Newton Updates with Bounds

Abstract

In each step of quasi-Newton methods an improved approximate solution \(x_ k\) is determined together with a new approximation \(B_ k\) of the derivative f'. Specifically, Broyden's method yields an update \(B_{k+1}\) which is the solution of the minimum problem: \(\min \{\| B-B_ k\|_ F: Bs_ k=y_ k\}.\) Here \(y_ k\) and \(s_ k\) are vectors which are computed during the iteration. If there is some extra information on the structure of the derivatives, one may consider the problem \(\min \{\| B-B_ k\|_ F: Bs_ k=y_ k,\) B satisfies extra conditions\(\}\). In the present paper this is done for the case that upper and lower bounds are known for the entries of the Jacobian matrix. It is shown that the known local convergence properties are not lost when the update is performed subject to the extra conditions.

Related Organizations
Keywords

quasi-Newton methods, Numerical mathematical programming methods, Broyden's method, Numerical computation of solutions to systems of equations, sparsity, large scale, local convergence, updates, bounds

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    36
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 1%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
36
Top 10%
Top 1%
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!