Rescaled multilevel least-change almost secant methods

S. M. Grzegorski

Mathematica Applicanda (1991)

  • Volume: 19, Issue: 33
  • ISSN: 1730-2668

Abstract

top
In this article the theory of local convergence is developed. One of the extensions consists in that the approximations to the Jacobian matrix have the same properties as the same matrix has in the solution. The example shows that this assumption may lead to simpler algorithms. The paper discusses several rescaled multilevel least-change updates for which local g-superlinear convergence is proved. The theory may be applied to a wider class of methods because every secant algorithm may be treated as a rescaled least-change method.

How to cite

top

S. M. Grzegorski. "Rescaled multilevel least-change almost secant methods." Mathematica Applicanda 19.33 (1991): null. <http://eudml.org/doc/292835>.

@article{S1991,
abstract = {In this article the theory of local convergence is developed. One of the extensions consists in that the approximations to the Jacobian matrix have the same properties as the same matrix has in the solution. The example shows that this assumption may lead to simpler algorithms. The paper discusses several rescaled multilevel least-change updates for which local g-superlinear convergence is proved. The theory may be applied to a wider class of methods because every secant algorithm may be treated as a rescaled least-change method.},
author = {S. M. Grzegorski},
journal = {Mathematica Applicanda},
keywords = {Systems of equations; Nonlinear programming},
language = {eng},
number = {33},
pages = {null},
title = {Rescaled multilevel least-change almost secant methods},
url = {http://eudml.org/doc/292835},
volume = {19},
year = {1991},
}

TY - JOUR
AU - S. M. Grzegorski
TI - Rescaled multilevel least-change almost secant methods
JO - Mathematica Applicanda
PY - 1991
VL - 19
IS - 33
SP - null
AB - In this article the theory of local convergence is developed. One of the extensions consists in that the approximations to the Jacobian matrix have the same properties as the same matrix has in the solution. The example shows that this assumption may lead to simpler algorithms. The paper discusses several rescaled multilevel least-change updates for which local g-superlinear convergence is proved. The theory may be applied to a wider class of methods because every secant algorithm may be treated as a rescaled least-change method.
LA - eng
KW - Systems of equations; Nonlinear programming
UR - http://eudml.org/doc/292835
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.