Needed: functions for computing an unconstrained and a bound-constrained trust-region step
"Joel T." <[email protected]> Mon, 9 Oct 2006 00:48:47 -0700 (PDT)
| Newsgroups | gmane.comp.gnu.octave.sources |
|---|---|
| Message-ID | <20061009074847.83789.qmail__19914.9597240195$1160381177$gmane$org@web56908.mail.re3.yahoo.com> |
Hi,
I'm looking functions which compute a trust region
step.
The first computes an unconstrained step, i.e. given:
H: size( H ) = n * n and H is symmetric,
g: size( g ) = n * 1
and
del > 1 ( scalar ),
compute
dx : min{ 0.5* dx'*H*dx + g'*dx }, ||dx||_2 <= del .
The second computes dx subject to bounds, i.e. given
two vectors of upper and lower bounds, xU and xL,
resp., compute dx as above s.t.
xL_i <= dx_i <= xU_i
where the subscripts indicate the ith vector
component.
Thank you,
Yoel.
__________________________________________________
Do You Yahoo!?
Tired of spam? Yahoo! Mail has the best spam protection around
http://mail.yahoo.com