<s>
The	O
sequence	O
of	O
Hessian	O
approximations	O
generated	O
by	O
the	O
SR1	O
method	O
converges	O
to	O
the	O
true	O
Hessian	O
under	O
mild	O
conditions	O
,	O
in	O
theory	O
;	O
in	O
practice	O
,	O
the	O
approximate	O
Hessians	O
generated	O
by	O
the	O
SR1	O
method	O
show	O
faster	O
progress	O
towards	O
the	O
true	O
Hessian	O
than	O
do	O
popular	O
alternatives	O
(	O
BFGS	B-Algorithm
or	O
DFP	B-Algorithm
)	O
,	O
in	O
preliminary	O
numerical	O
experiments	O
.	O
</s>
<s>
The	O
SR1	O
method	O
has	O
computational	O
advantages	O
for	O
sparse	B-Algorithm
or	O
partially	O
separable	O
problems	O
.	O
</s>
<s>
The	O
SR1	B-Algorithm
formula	I-Algorithm
computes	O
(	O
via	O
an	O
update	O
of	O
rank	O
1	O
)	O
the	O
symmetric	O
solution	O
that	O
is	O
closest	O
to	O
the	O
current	O
approximate-value	O
:	O
</s>
<s>
The	O
SR1	B-Algorithm
formula	I-Algorithm
has	O
been	O
rediscovered	O
a	O
number	O
of	O
times	O
.	O
</s>
