1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
|
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html401/loose.dtd">
<html>
<!-- Created on April, 24 2010 by texi2html 1.76 -->
<!--
Written by: Lionel Cons <Lionel.Cons@cern.ch> (original author)
Karl Berry <karl@freefriends.org>
Olaf Bachmann <obachman@mathematik.uni-kl.de>
and many others.
Maintained by: Many creative people <dev@texi2html.cvshome.org>
Send bugs and suggestions to <users@texi2html.cvshome.org>
-->
<head>
<title>Maxima 5.21.1 Manual: 59. lbfgs</title>
<meta name="description" content="Maxima 5.21.1 Manual: 59. lbfgs">
<meta name="keywords" content="Maxima 5.21.1 Manual: 59. lbfgs">
<meta name="resource-type" content="document">
<meta name="distribution" content="global">
<meta name="Generator" content="texi2html 1.76">
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
<style type="text/css">
<!--
a.summary-letter {text-decoration: none}
pre.display {font-family: serif}
pre.format {font-family: serif}
pre.menu-comment {font-family: serif}
pre.menu-preformatted {font-family: serif}
pre.smalldisplay {font-family: serif; font-size: smaller}
pre.smallexample {font-size: smaller}
pre.smallformat {font-family: serif; font-size: smaller}
pre.smalllisp {font-size: smaller}
span.sansserif {font-family:sans-serif; font-weight:normal;}
ul.toc {list-style: none}
body
{
color: black;
background: white;
margin-left: 8%;
margin-right: 13%;
}
h1
{
margin-left: +8%;
font-size: 150%;
font-family: sans-serif
}
h2
{
font-size: 125%;
font-family: sans-serif
}
h3
{
font-size: 100%;
font-family: sans-serif
}
h2,h3,h4,h5,h6 { margin-left: +4%; }
div.textbox
{
border: solid;
border-width: thin;
/* width: 100%; */
padding-top: 1em;
padding-bottom: 1em;
padding-left: 2em;
padding-right: 2em
}
div.titlebox
{
border: none;
padding-top: 1em;
padding-bottom: 1em;
padding-left: 2em;
padding-right: 2em;
background: rgb(200,255,255);
font-family: sans-serif
}
div.synopsisbox
{
border: none;
padding-top: 1em;
padding-bottom: 1em;
padding-left: 2em;
padding-right: 2em;
background: rgb(255,220,255);
/*background: rgb(200,255,255); */
/* font-family: fixed */
}
pre.example
{
border: 1px solid gray;
padding-top: 1em;
padding-bottom: 1em;
padding-left: 1em;
padding-right: 1em;
/* background: rgb(247,242,180); */ /* kind of sandy */
/* background: rgb(200,255,255); */ /* sky blue */
background-color: #F1F5F9; /* light blue-gray */
/* font-family: "Lucida Console", monospace */
}
div.spacerbox
{
border: none;
padding-top: 2em;
padding-bottom: 2em
}
div.image
{
margin: 0;
padding: 1em;
text-align: center;
}
div.categorybox
{
border: 1px solid gray;
padding-top: 0px;
padding-bottom: 0px;
padding-left: 1em;
padding-right: 1em;
background: rgb(247,242,220);
}
-->
</style>
<link rel="icon" href="http://maxima.sourceforge.net/favicon.ico"/>
</head>
<body lang="en" bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#800080" alink="#FF0000">
<a name="lbfgs"></a>
<a name="SEC252"></a>
<table cellpadding="1" cellspacing="1" border="0">
<tr><td valign="middle" align="left">[<a href="maxima_58.html#SEC251" title="Previous section in reading order"> < </a>]</td>
<td valign="middle" align="left">[<a href="#SEC253" title="Next section in reading order"> > </a>]</td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left">[<a href="maxima_58.html#SEC249" title="Beginning of this chapter or previous chapter"> << </a>]</td>
<td valign="middle" align="left">[<a href="maxima.html#SEC_Top" title="Up section"> Up </a>]</td>
<td valign="middle" align="left">[<a href="maxima_60.html#SEC255" title="Next chapter"> >> </a>]</td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left">[<a href="maxima.html#SEC_Top" title="Cover (top) of document">Top</a>]</td>
<td valign="middle" align="left">[<a href="maxima_toc.html#SEC_Contents" title="Table of contents">Contents</a>]</td>
<td valign="middle" align="left">[<a href="maxima_79.html#SEC331" title="Index">Index</a>]</td>
<td valign="middle" align="left">[<a href="maxima_abt.html#SEC_About" title="About (help)"> ? </a>]</td>
</tr></table>
<h1 class="chapter"> 59. lbfgs </h1>
<table class="menu" border="0" cellspacing="0">
<tr><td align="left" valign="top"><a href="#SEC253">59.1 Introduction to lbfgs</a></td><td> </td><td align="left" valign="top">
</td></tr>
<tr><td align="left" valign="top"><a href="#SEC254">59.2 Functions and Variables for lbfgs</a></td><td> </td><td align="left" valign="top">
</td></tr>
</table>
<p><a name="Item_003a-Introduction-to-lbfgs"></a>
</p><hr size="6">
<a name="Introduction-to-lbfgs"></a>
<a name="SEC253"></a>
<table cellpadding="1" cellspacing="1" border="0">
<tr><td valign="middle" align="left">[<a href="#SEC252" title="Previous section in reading order"> < </a>]</td>
<td valign="middle" align="left">[<a href="#SEC254" title="Next section in reading order"> > </a>]</td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left">[<a href="#SEC252" title="Beginning of this chapter or previous chapter"> << </a>]</td>
<td valign="middle" align="left">[<a href="#SEC252" title="Up section"> Up </a>]</td>
<td valign="middle" align="left">[<a href="maxima_60.html#SEC255" title="Next chapter"> >> </a>]</td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left">[<a href="maxima.html#SEC_Top" title="Cover (top) of document">Top</a>]</td>
<td valign="middle" align="left">[<a href="maxima_toc.html#SEC_Contents" title="Table of contents">Contents</a>]</td>
<td valign="middle" align="left">[<a href="maxima_79.html#SEC331" title="Index">Index</a>]</td>
<td valign="middle" align="left">[<a href="maxima_abt.html#SEC_About" title="About (help)"> ? </a>]</td>
</tr></table>
<h2 class="section"> 59.1 Introduction to lbfgs </h2>
<p><code>lbfgs</code> is an implementation of the L-BFGS algorithm [1]
to solve unconstrained minimization problems via a limited-memory quasi-Newton (BFGS) algorithm.
It is called a limited-memory method because a low-rank approximation of the
Hessian matrix inverse is stored instead of the entire Hessian inverse.
The program was originally written in Fortran [2] by Jorge Nocedal,
incorporating some functions originally written by Jorge J. Moré and David J. Thuente,
and translated into Lisp automatically via the program <code>f2cl</code>.
The Maxima package <code>lbfgs</code> comprises the translated code plus
an interface function which manages some details.
</p>
<p>References:
</p>
<p>[1] D. Liu and J. Nocedal. "On the limited memory BFGS method for large
scale optimization". <i>Mathematical Programming B</i> 45:503-528 (1989)
</p>
<p>[2] <a href="http://netlib.org/opt/lbfgs_um.shar">http://netlib.org/opt/lbfgs_um.shar</a>
</p>
<div class=categorybox>
<p>Categories: <a href="maxima_95.html#Category_003a-Numerical-methods">Numerical methods</a>
·
<a href="maxima_95.html#Category_003a-Share-packages">Share packages</a>
·
<a href="maxima_95.html#Category_003a-Package-lbfgs">Package lbfgs</a>
</p>
</div>
<p><a name="Item_003a-Functions-and-Variables-for-lbfgs"></a>
</p><hr size="6">
<a name="Functions-and-Variables-for-lbfgs"></a>
<a name="SEC254"></a>
<table cellpadding="1" cellspacing="1" border="0">
<tr><td valign="middle" align="left">[<a href="#SEC253" title="Previous section in reading order"> < </a>]</td>
<td valign="middle" align="left">[<a href="maxima_60.html#SEC255" title="Next section in reading order"> > </a>]</td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left">[<a href="#SEC252" title="Beginning of this chapter or previous chapter"> << </a>]</td>
<td valign="middle" align="left">[<a href="#SEC252" title="Up section"> Up </a>]</td>
<td valign="middle" align="left">[<a href="maxima_60.html#SEC255" title="Next chapter"> >> </a>]</td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left">[<a href="maxima.html#SEC_Top" title="Cover (top) of document">Top</a>]</td>
<td valign="middle" align="left">[<a href="maxima_toc.html#SEC_Contents" title="Table of contents">Contents</a>]</td>
<td valign="middle" align="left">[<a href="maxima_79.html#SEC331" title="Index">Index</a>]</td>
<td valign="middle" align="left">[<a href="maxima_abt.html#SEC_About" title="About (help)"> ? </a>]</td>
</tr></table>
<h2 class="section"> 59.2 Functions and Variables for lbfgs </h2>
<dl>
<dt><u>Function:</u> <b>lbfgs</b><i> (<var>FOM</var>, <var>X</var>, <var>X0</var>, <var>epsilon</var>, <var>iprint</var>)</i>
<a name="IDX2298"></a>
</dt>
<dt><u>Function:</u> <b>lbfgs</b><i> ([<var>FOM</var>, <var>grad</var>] <var>X</var>, <var>X0</var>, <var>epsilon</var>, <var>iprint</var>)</i>
<a name="IDX2299"></a>
</dt>
<dd><p>Finds an approximate solution of the unconstrained minimization of the figure of merit <var>FOM</var>
over the list of variables <var>X</var>,
starting from initial estimates <var>X0</var>,
such that <em>norm(grad(FOM)) < epsilon*max(1, norm(X))</em>.
</p>
<p><var>grad</var>, if present, is the gradient of <var>FOM</var> with respect to the variables <var>X</var>.
<var>grad</var> is a list, with one element for each element of <var>X</var>.
If not present, the gradient is computed automatically by symbolic differentiation.
</p>
<p>The algorithm applied is a limited-memory quasi-Newton (BFGS) algorithm [1].
It is called a limited-memory method because a low-rank approximation of the
Hessian matrix inverse is stored instead of the entire Hessian inverse.
Each iteration of the algorithm is a line search, that is,
a search along a ray in the variables <var>X</var>,
with the search direction computed from the approximate Hessian inverse.
The FOM is always decreased by a successful line search.
Usually (but not always) the norm of the gradient of FOM also decreases.
</p>
<p><var>iprint</var> controls progress messages printed by <code>lbfgs</code>.
</p>
<dl compact="compact">
<dt> <code>iprint[1]</code></dt>
<dd><p><code><var>iprint</var>[1]</code> controls the frequency of progress messages.
</p><dl compact="compact">
<dt> <code>iprint[1] < 0</code></dt>
<dd><p>No progress messages.
</p></dd>
<dt> <code>iprint[1] = 0</code></dt>
<dd><p>Messages at the first and last iterations.
</p></dd>
<dt> <code>iprint[1] > 0</code></dt>
<dd><p>Print a message every <code><var>iprint</var>[1]</code> iterations.
</p></dd>
</dl>
</dd>
<dt> <code>iprint[2]</code></dt>
<dd><p><code><var>iprint</var>[2]</code> controls the verbosity of progress messages.
</p><dl compact="compact">
<dt> <code>iprint[2] = 0</code></dt>
<dd><p>Print out iteration count, number of evaluations of <var>FOM</var>, value of <var>FOM</var>,
norm of the gradient of <var>FOM</var>, and step length.
</p></dd>
<dt> <code>iprint[2] = 1</code></dt>
<dd><p>Same as <code><var>iprint</var>[2] = 0</code>, plus <var>X0</var> and the gradient of <var>FOM</var> evaluated at <var>X0</var>.
</p></dd>
<dt> <code>iprint[2] = 2</code></dt>
<dd><p>Same as <code><var>iprint</var>[2] = 1</code>, plus values of <var>X</var> at each iteration.
</p></dd>
<dt> <code>iprint[2] = 3</code></dt>
<dd><p>Same as <code><var>iprint</var>[2] = 2</code>, plus the gradient of <var>FOM</var> at each iteration.
</p></dd>
</dl>
</dd>
</dl>
<p>The columns printed by <code>lbfgs</code> are the following.
</p>
<dl compact="compact">
<dt> <code>I</code></dt>
<dd><p>Number of iterations. It is incremented for each line search.
</p></dd>
<dt> <code>NFN</code></dt>
<dd><p>Number of evaluations of the figure of merit.
</p></dd>
<dt> <code>FUNC</code></dt>
<dd><p>Value of the figure of merit at the end of the most recent line search.
</p></dd>
<dt> <code>GNORM</code></dt>
<dd><p>Norm of the gradient of the figure of merit at the end of the most recent line search.
</p></dd>
<dt> <code>STEPLENGTH</code></dt>
<dd><p>An internal parameter of the search algorithm.
</p></dd>
</dl>
<p>Additional information concerning details of the algorithm are found in the
comments of the original Fortran code [2].
</p>
<p>See also <code>lbfgs_nfeval_max</code> and <code>lbfgs_ncorrections</code>.
</p>
<p>References:
</p>
<p>[1] D. Liu and J. Nocedal. "On the limited memory BFGS method for large
scale optimization". <i>Mathematical Programming B</i> 45:503-528 (1989)
</p>
<p>[2] <a href="http://netlib.org/opt/lbfgs_um.shar">http://netlib.org/opt/lbfgs_um.shar</a>
</p>
<p>Examples:
</p>
<p>The same FOM as computed by FGCOMPUTE in the program sdrive.f in the LBFGS package from Netlib.
Note that the variables in question are subscripted variables.
The FOM has an exact minimum equal to zero at <em>u[k] = 1</em> for <em>k = 1, ..., 8</em>.
</p>
<pre class="example">(%i1) load (lbfgs);
(%o1) /usr/share/maxima/5.10.0cvs/share/lbfgs/lbfgs.mac
(%i2) t1[j] := 1 - u[j];
(%o2) t1 := 1 - u
j j
(%i3) t2[j] := 10*(u[j + 1] - u[j]^2);
2
(%o3) t2 := 10 (u - u )
j j + 1 j
(%i4) n : 8;
(%o4) 8
(%i5) FOM : sum (t1[2*j - 1]^2 + t2[2*j - 1]^2, j, 1, n/2);
2 2 2 2 2 2
(%o5) 100 (u - u ) + (1 - u ) + 100 (u - u ) + (1 - u )
8 7 7 6 5 5
2 2 2 2 2 2
+ 100 (u - u ) + (1 - u ) + 100 (u - u ) + (1 - u )
4 3 3 2 1 1
(%i6) lbfgs (FOM, '[u[1],u[2],u[3],u[4],u[5],u[6],u[7],u[8]],
[-1.2, 1, -1.2, 1, -1.2, 1, -1.2, 1], 1e-3, [1, 0]);
*************************************************
N= 8 NUMBER OF CORRECTIONS=25
INITIAL VALUES
F= 9.680000000000000D+01 GNORM= 4.657353755084532D+02
*************************************************
</pre><pre class="example"> I NFN FUNC GNORM STEPLENGTH
1 3 1.651479526340304D+01 4.324359291335977D+00 7.926153934390631D-04
2 4 1.650209316638371D+01 3.575788161060007D+00 1.000000000000000D+00
3 5 1.645461701312851D+01 6.230869903601577D+00 1.000000000000000D+00
4 6 1.636867301275588D+01 1.177589920974980D+01 1.000000000000000D+00
5 7 1.612153014409201D+01 2.292797147151288D+01 1.000000000000000D+00
6 8 1.569118407390628D+01 3.687447158775571D+01 1.000000000000000D+00
7 9 1.510361958398942D+01 4.501931728123680D+01 1.000000000000000D+00
8 10 1.391077875774294D+01 4.526061463810632D+01 1.000000000000000D+00
9 11 1.165625686278198D+01 2.748348965356917D+01 1.000000000000000D+00
10 12 9.859422687859137D+00 2.111494974231644D+01 1.000000000000000D+00
11 13 7.815442521732281D+00 6.110762325766556D+00 1.000000000000000D+00
12 15 7.346380905773160D+00 2.165281166714631D+01 1.285316401779533D-01
13 16 6.330460634066370D+00 1.401220851762050D+01 1.000000000000000D+00
14 17 5.238763939851439D+00 1.702473787613255D+01 1.000000000000000D+00
15 18 3.754016790406701D+00 7.981845727704576D+00 1.000000000000000D+00
16 20 3.001238402309352D+00 3.925482944716691D+00 2.333129631296807D-01
17 22 2.794390709718290D+00 8.243329982546473D+00 2.503577283782332D-01
18 23 2.563783562918759D+00 1.035413426521790D+01 1.000000000000000D+00
19 24 2.019429976377856D+00 1.065187312346769D+01 1.000000000000000D+00
20 25 1.428003167670903D+00 2.475962450826961D+00 1.000000000000000D+00
21 27 1.197874264861340D+00 8.441707983493810D+00 4.303451060808756D-01
22 28 9.023848941942773D-01 1.113189216635162D+01 1.000000000000000D+00
23 29 5.508226405863770D-01 2.380830600326308D+00 1.000000000000000D+00
24 31 3.902893258815567D-01 5.625595816584421D+00 4.834988416524465D-01
25 32 3.207542206990315D-01 1.149444645416472D+01 1.000000000000000D+00
26 33 1.874468266362791D-01 3.632482152880997D+00 1.000000000000000D+00
27 34 9.575763380706598D-02 4.816497446154354D+00 1.000000000000000D+00
28 35 4.085145107543406D-02 2.087009350166495D+00 1.000000000000000D+00
29 36 1.931106001379290D-02 3.886818608498966D+00 1.000000000000000D+00
30 37 6.894000721499670D-03 3.198505796342214D+00 1.000000000000000D+00
31 38 1.443296033051864D-03 1.590265471025043D+00 1.000000000000000D+00
32 39 1.571766603154336D-04 3.098257063980634D-01 1.000000000000000D+00
33 40 1.288011776581970D-05 1.207784183577257D-02 1.000000000000000D+00
34 41 1.806140173752971D-06 4.587890233385193D-02 1.000000000000000D+00
35 42 1.769004645459358D-07 1.790537375052208D-02 1.000000000000000D+00
36 43 3.312164100763217D-10 6.782068426119681D-04 1.000000000000000D+00
</pre><pre class="example">
THE MINIMIZATION TERMINATED WITHOUT DETECTING ERRORS.
IFLAG = 0
(%o6) [u = 1.000005339815974, u = 1.000009942839805,
1 2
u = 1.000005339815974, u = 1.000009942839805,
3 4
u = 1.000005339815974, u = 1.000009942839805,
5 6
u = 1.000005339815974, u = 1.000009942839805]
7 8
</pre>
<p>A regression problem.
The FOM is the mean square difference between the predicted value <em>F(X[i])</em>
and the observed value <em>Y[i]</em>.
The function <em>F</em> is a bounded monotone function (a so-called "sigmoidal" function).
In this example, <code>lbfgs</code> computes approximate values for the parameters of <em>F</em>
and <code>plot2d</code> displays a comparison of <em>F</em> with the observed data.
</p>
<pre class="example">(%i1) load (lbfgs);
(%o1) /usr/share/maxima/5.10.0cvs/share/lbfgs/lbfgs.mac
(%i2) FOM : '((1/length(X))*sum((F(X[i]) - Y[i])^2, i, 1,
length(X)));
2
sum((F(X ) - Y ) , i, 1, length(X))
i i
(%o2) -----------------------------------
length(X)
(%i3) X : [1, 2, 3, 4, 5];
(%o3) [1, 2, 3, 4, 5]
(%i4) Y : [0, 0.5, 1, 1.25, 1.5];
(%o4) [0, 0.5, 1, 1.25, 1.5]
(%i5) F(x) := A/(1 + exp(-B*(x - C)));
A
(%o5) F(x) := ----------------------
1 + exp((- B) (x - C))
(%i6) ''FOM;
A 2 A 2
(%o6) ((----------------- - 1.5) + (----------------- - 1.25)
- B (5 - C) - B (4 - C)
%e + 1 %e + 1
A 2 A 2
+ (----------------- - 1) + (----------------- - 0.5)
- B (3 - C) - B (2 - C)
%e + 1 %e + 1
2
A
+ --------------------)/5
- B (1 - C) 2
(%e + 1)
(%i7) estimates : lbfgs (FOM, '[A, B, C], [1, 1, 1], 1e-4, [1, 0]);
*************************************************
N= 3 NUMBER OF CORRECTIONS=25
INITIAL VALUES
F= 1.348738534246918D-01 GNORM= 2.000215531936760D-01
*************************************************
</pre><pre class="example">I NFN FUNC GNORM STEPLENGTH
1 3 1.177820636622582D-01 9.893138394953992D-02 8.554435968992371D-01
2 6 2.302653892214013D-02 1.180098521565904D-01 2.100000000000000D+01
3 8 1.496348495303005D-02 9.611201567691633D-02 5.257340567840707D-01
4 9 7.900460841091139D-03 1.325041647391314D-02 1.000000000000000D+00
5 10 7.314495451266917D-03 1.510670810312237D-02 1.000000000000000D+00
6 11 6.750147275936680D-03 1.914964958023047D-02 1.000000000000000D+00
7 12 5.850716021108205D-03 1.028089194579363D-02 1.000000000000000D+00
8 13 5.778664230657791D-03 3.676866074530332D-04 1.000000000000000D+00
9 14 5.777818823650782D-03 3.010740179797255D-04 1.000000000000000D+00
</pre><pre class="example">
THE MINIMIZATION TERMINATED WITHOUT DETECTING ERRORS.
IFLAG = 0
(%o7) [A = 1.461933911464101, B = 1.601593973254802,
C = 2.528933072164854]
(%i8) plot2d ([F(x), [discrete, X, Y]], [x, -1, 6]), ''estimates;
(%o8)
</pre>
<p>Gradient of FOM is specified (instead of computing it automatically).
</p>
<pre class="example">(%i1) load (lbfgs)$
(%i2) F(a, b, c) := (a - 5)^2 + (b - 3)^4 + (c - 2)^6;
2 4 6
(%o2) F(a, b, c) := (a - 5) + (b - 3) + (c - 2)
(%i3) F_grad : map (lambda ([x], diff (F(a, b, c), x)), [a, b, c]);
3 5
(%o3) [2 (a - 5), 4 (b - 3) , 6 (c - 2) ]
(%i4) estimates : lbfgs ([F(a, b, c), F_grad], [a, b, c], [0, 0, 0], 1e-4, [1, 0]);
*************************************************
N= 3 NUMBER OF CORRECTIONS=25
INITIAL VALUES
F= 1.700000000000000D+02 GNORM= 2.205175729958953D+02
*************************************************
</pre><pre class="example"> I NFN FUNC GNORM STEPLENGTH
1 2 6.632967565917638D+01 6.498411132518770D+01 4.534785987412505D-03
2 3 4.368890936228036D+01 3.784147651974131D+01 1.000000000000000D+00
3 4 2.685298972775190D+01 1.640262125898521D+01 1.000000000000000D+00
4 5 1.909064767659852D+01 9.733664001790506D+00 1.000000000000000D+00
5 6 1.006493272061515D+01 6.344808151880209D+00 1.000000000000000D+00
6 7 1.215263596054294D+00 2.204727876126879D+00 1.000000000000000D+00
7 8 1.080252896385334D-02 1.431637116951849D-01 1.000000000000000D+00
8 9 8.407195124830908D-03 1.126344579730013D-01 1.000000000000000D+00
9 10 5.022091686198527D-03 7.750731829225274D-02 1.000000000000000D+00
10 11 2.277152808939775D-03 5.032810859286795D-02 1.000000000000000D+00
11 12 6.489384688303218D-04 1.932007150271008D-02 1.000000000000000D+00
12 13 2.075791943844548D-04 6.964319310814364D-03 1.000000000000000D+00
13 14 7.349472666162257D-05 4.017449067849554D-03 1.000000000000000D+00
14 15 2.293617477985237D-05 1.334590390856715D-03 1.000000000000000D+00
15 16 7.683645404048675D-06 6.011057038099201D-04 1.000000000000000D+00
</pre><pre class="example">
THE MINIMIZATION TERMINATED WITHOUT DETECTING ERRORS.
IFLAG = 0
(%o4) [a = 5.000086823042934, b = 3.05239542970518,
c = 1.927980629919583]
</pre>
<div class=categorybox>
<p>Categories: <a href="maxima_95.html#Category_003a-Package-lbfgs">Package lbfgs</a>
</p>
</div>
</dd></dl>
<p><a name="Item_003a-lbfgs_005fnfeval_005fmax"></a>
</p><dl>
<dt><u>Variable:</u> <b>lbfgs_nfeval_max</b>
<a name="IDX2300"></a>
</dt>
<dd><p>Default value: 100
</p>
<p><code>lbfgs_nfeval_max</code> is the maximum number of evaluations of the figure of merit (FOM) in <code>lbfgs</code>.
When <code>lbfgs_nfeval_max</code> is reached,
<code>lbfgs</code> returns the result of the last successful line search.
</p>
<div class=categorybox>
<p>Categories: <a href="maxima_95.html#Category_003a-Package-lbfgs">Package lbfgs</a>
</p>
</div>
</dd></dl>
<p><a name="Item_003a-lbfgs_005fncorrections"></a>
</p><dl>
<dt><u>Variable:</u> <b>lbfgs_ncorrections</b>
<a name="IDX2301"></a>
</dt>
<dd><p>Default value: 25
</p>
<p><code>lbfgs_ncorrections</code> is the number of corrections applied
to the approximate inverse Hessian matrix which is maintained by <code>lbfgs</code>.
</p>
<div class=categorybox>
<p>Categories: <a href="maxima_95.html#Category_003a-Package-lbfgs">Package lbfgs</a>
</p>
</div>
</dd></dl>
<p><a name="Item_003a-lindstedt"></a>
</p><hr size="6">
<table cellpadding="1" cellspacing="1" border="0">
<tr><td valign="middle" align="left">[<a href="#SEC252" title="Beginning of this chapter or previous chapter"> << </a>]</td>
<td valign="middle" align="left">[<a href="maxima_60.html#SEC255" title="Next chapter"> >> </a>]</td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left"> </td>
<td valign="middle" align="left">[<a href="maxima.html#SEC_Top" title="Cover (top) of document">Top</a>]</td>
<td valign="middle" align="left">[<a href="maxima_toc.html#SEC_Contents" title="Table of contents">Contents</a>]</td>
<td valign="middle" align="left">[<a href="maxima_79.html#SEC331" title="Index">Index</a>]</td>
<td valign="middle" align="left">[<a href="maxima_abt.html#SEC_About" title="About (help)"> ? </a>]</td>
</tr></table>
<p>
<font size="-1">
This document was generated by <em>Robert Dodier</em> on <em>April, 24 2010</em> using <a href="http://texi2html.cvshome.org/"><em>texi2html 1.76</em></a>.
</font>
<br>
</p>
</body>
</html>
|
