Learn R Programming

bmrm (version 3.3)

wolfe.linesearch: Wolfe Line Search

Description

Implements Wolfe Line Search algorithm. The code is inspired from Matlab code of Do and Artiere, but not tested. The function is not used yet, but might be used later to speed up bmrm/nrbm convergence.

Usage

wolfe.linesearch(f, x0, f0, s0, ..., a1 = 0.5, amax = 1.1, c1 = 1e-04,
  c2 = 0.9, maxiter = 5L)

Arguments

f

a function to minimize. It must accept as first argument a numeric vector representing the optimization point and return a numeric value, with gradient attribute setted

x0

initial search point

f0

initial function value

s0

direction of the search from x0

...

additional parameters passed to f()

a1

first step coefficient guess

amax

max coefficient value

c1

lower bound

c2

upper bound

maxiter

maximum number of iteration for this linesearch

Value

the optimal point as a 3 element list

References

Do and Artieres Regularized Bundle Methods for Convex and Non-Convex Risks JMLR 2012

See Also

bmrm nrbm