OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:BFGS
(Results
1 - 5
of
5
) sorted by null
/external/ceres-solver/internal/ceres/
line_search_direction.cc
115
<< "Ceres bug: NextDirection() called on L-
BFGS
after inverse Hessian "
129
LOG(WARNING) << "Numerical failure in L-
BFGS
update: inverse Hessian "
145
class
BFGS
: public LineSearchDirection {
147
BFGS
(const int num_parameters,
154
<< "
BFGS
line search being created with: " << num_parameters_
157
<< ", consider using the L-
BFGS
memory-efficient line search direction "
164
virtual ~
BFGS
() {}
170
<< "Ceres bug: NextDirection() called on
BFGS
after inverse Hessian "
178
// The (L)
BFGS
algorithm explicitly requires that the secant equation:
194
// Although Ceres will always use a Wolfe line search when using (L)
BFGS
,
[
all
...]
types.cc
188
CASESTR(
BFGS
);
200
STRENUM(
BFGS
);
solver.cc
244
if ((options.line_search_direction_type == ceres::
BFGS
||
251
+ string(". When using (L)
BFGS
, "
/external/ceres-solver/include/ceres/
types.h
191
//
BFGS
, and it's limited memory approximation L-
BFGS
, are quasi-Newton
200
// remaining degrees-of-freedom. (L)
BFGS
methods uniquely deteremine the
205
// (L)
BFGS
& DFP). (L)
BFGS
is currently regarded as being the best known
208
// The principal difference between
BFGS
and L-
BFGS
is that whilst
BFGS
209
// maintains a full, dense approximation to the (inverse) Hessian, L-
BFGS
217
// For more details on
BFGS
see
[
all
...]
/external/ceres-solver/scripts/
ceres-solver.spec
43
- Line search solvers (L-
BFGS
and Nonlinear CG)
Completed in 96 milliseconds