Go to the source code of this file.
|
module | cp_lbfgs_optimizer_gopt |
| routines that optimize a functional using the limited memory bfgs quasi-newton method. The process set up so that a master runs the real optimizer and the others help then to calculate the objective function. The arguments for the objective function are physically present in every processor (nedeed in the actual implementation of pao). In the future tha arguments themselves could be distributed.
|
|
|
subroutine, public | cp_lbfgs_optimizer_gopt::cp_opt_gopt_create (optimizer, para_env, obj_funct, x0, m, print_every, wanted_relative_f_delta, wanted_projected_gradient, lower_bound, upper_bound, kind_of_bound, master, max_f_per_iter, trust_radius) |
| initializes the optimizer
|
|
subroutine, public | cp_lbfgs_optimizer_gopt::cp_opt_gopt_release (optimizer) |
| releases the optimizer (see doc/ReferenceCounting.html)
|
|
logical function, public | cp_lbfgs_optimizer_gopt::cp_opt_gopt_next (optimizer, n_iter, f, last_f, projected_gradient, converged, geo_section, force_env, gopt_param, spgr) |
| goes to the next optimal point (after an optimizer iteration) returns true if converged
|
|
subroutine, public | cp_lbfgs_optimizer_gopt::cp_opt_gopt_stop (optimizer) |
| stops the optimization
|
|