Practical methods for optimal control using nonlinear programming 1st Edition John T. Betts download
Practical methods for optimal control using nonlinear programming 1st Edition John T. Betts download
https://ebookname.com/product/practical-methods-for-optimal-
control-using-nonlinear-programming-1st-edition-john-t-betts/
https://ebookname.com/product/practical-methods-for-optimal-
control-and-estimation-using-nonlinear-programming-second-
edition-advances-in-design-and-control-john-t-betts/
https://ebookname.com/product/nonlinear-optimal-control-
theory-1st-edition-leonard-david-berkovitz/
https://ebookname.com/product/nonparametric-statistical-methods-
using-r-1st-edition-john-kloke/
https://ebookname.com/product/beginning-teaching-beginning-
learning-in-primary-education-3rd-edition-janet-moyles/
Essential College Physics with MasteringPhysics 1st
Edition Andrew Rex
https://ebookname.com/product/essential-college-physics-with-
masteringphysics-1st-edition-andrew-rex/
https://ebookname.com/product/half-a-century-of-music-in-
england-1837-1887-essays-towards-a-history-francis-hueffer/
https://ebookname.com/product/examining-core-elements-of-
international-research-collaboration-institute-of-medicine/
https://ebookname.com/product/methods-for-the-economic-
evaluation-of-health-care-programmes-4th-edition-michael-f-
drummond/
https://ebookname.com/product/fundamentals-of-oral-histology-and-
physiology-1st-edition-arthur-r-hand/
Bruce Lee A Life 1st Edition Matthew Polly
https://ebookname.com/product/bruce-lee-a-life-1st-edition-
matthew-polly/
Practical Methods
for Optimal Control
Using Nonlinear
Programming
Advances in Design and Control
SIAM's Advances in Design and Control series consists of texts and monographs dealing with
all areas of design and control and their applications. Topics of interest include shape
optimization, multidisciplinary design, trajectory optimization, feedback, and optimal control.
The series focuses on the mathematical and computational aspects of engineering design and
control that are usable in a wide variety of scientific and engineering disciplines.
Editor-in-Chief
John A. Burns, Virginia Polytechnic Institute and State University
Editorial Board
H. Thomas Banks, North Carolina State University
Stephen L. Campbell, North Carolina State University
Eugene M. Cliff, Virginia Polytechnic Institute and State University
Ruth Curtain, University of Groningen
Michel C. Delfour, University of Montreal
John Doyle, California Institute of Technology
Max D. Gunzburger, Iowa State University
Rafael Haftka, University of Florida
Jaroslav Haslinger, Charles University
J. William Helton, University of California at San Diego
Art Krener, University of California at Davis
Alan Laub, University of California at Davis
Steven I. Marcus, University of Maryland
Harris McClamroch, University of Michigan
Richard Murray, California Institute of Technology
Anthony Patera, Massachusetts Institute of Technology
H. Mete Soner, Carnegie Mellon University
Jason Speyer, University of California at Los Angeles
Hector Sussmann, Rutgers University
Allen Tannenbaum, University of Minnesota
Virginia Torczon, William and Mary University
Series Volumes
Betts, John T., Practical Methods for Optimal Control Using Nonlinear Programming
El Ghaoui, Laurent and Niculescu, Silviu-lulian, eds., Advances in Linear Matrix Inequality
Methods in Control
Helton, J. William and James, Matthew R., Extending H°° Control to Nonlinear Systems:
Control of Nonlinear Systems to Achieve Performance Objectives
Practical Methods
for Optimal Control
Using Nonlinear
Programming
John T. Betts
The Boeing Company
Seattle, Washington
Siam
Society for Industrial and Applied Mathematics
Philadelphia
Copyright ©2001 by the Society for Industrial and Applied Mathematics.
10987654321
All rights reserved. Printed in the United States of America. No part of this book may
be reproduced, stored, or transmitted in any manner without the written permission
of the publisher. For information, write to the Society for Industrial and Applied
Mathematics, 3600 University City Science Center, Philadelphia, PA 19104-2688.
Preface ix
vii
viii CONTENTS
Bibliography 181
Index 189
Preface
Solving an optimal control problem is not easy. Pieces of the puzzle are found scattered
throughout many different disciplines. Furthermore, the focus of this book is on practical
methods, that is, methods that I have found actually work! In fact everything described
in this book has been implemented in production software and used to solve real optimal
control problems. Although the reader should be proficient in advanced mathematics, no
theorems are presented.
Traditionally, there are two major parts of a successful optimal control solution tech-
nique. The first part is the "optimization" method. The second part is the ''differential
equation'' method. When faced with an optimal control problem, it is tempting to sim-
ply "paste" together packages for optimization and numerical integration. While naive
approaches such as this may be moderately successful, the goal of this book is to suggest
that there is a better way! The methods used to solve the differential equations and
optimize the functions are intimately related.
The first two chapters of this book focus on the optimization part of the problem.
In Chapter 1, the important concepts of nonlinear programming for small, dense appli-
cations are introduced. Chapter 2 extends the presentation to problems that are both
large and sparse. Chapters 3 and 4 address the differential equation part of the prob-
lem. Chapter 3 introduces relevant material in the numerical solution of differential (and
differential-algebraic) equations. Methods for solving the optimal control problem are
treated in some detail in Chapter 4. Throughout the book, the interaction between op-
timization and integration is emphasized. Chapter 5 presents a collection of examples
that illustrate the various concepts and techniques.
The book does not cover everything. Many important topics are simply not discussed
in order to keep the overall presentation concise and focused. The discussion is general
and presents a unified approach to solving optimal control problems. Most of the ex-
amples are drawn from my experience in the aerospace industry. Examples have been
solved using a particular implementation called SOCS. I have tried to adhere to nota-
tional conventions from both optimization and control theory whenever possible. Also,
I have attempted to use consistent notation throughout the book.
The material presented here represents the collective contributions of many people.
The nonlinear programming material draws heavily on the work of John Dennis, Roger
Fletcher, Philip Gill, Walter Murray, Michael Saunders, and Margaret Wright. The ma-
terial on differential-algebraic equations is drawn from the work of Uri Ascher. Kathy
Brenari, Steve Campbell, and Linda Petzold. I was introduced to optimal control by
Stephen Citron, and routinely refer to the text by Bryson and Ho [35]. Over the past 10
years I have been fortunate to participate in workshops at Oberwolfach. Munich, Min-
neapolis. Victoria, Lausanne, and Griefswald. I benefited immensely simply by talking
with Larry Biegler, Hans Georg Bock, Roland Bulirsch, Rainer Callies, Kurt Chudej,
ix
x PREFACE
Tim Kelley, Bernd Kugelmann, Helmut Maurer, Rainer Mehlhorn, Angelo Miele, Hans
Josef Pesch, Ekkehard Sachs, Gottfried Sachs, Roger Sargent. Volker Schulz, Mark Stein-
bach, Oskar von Stryk, and Klaus Well.
Two coworkers deserve special thanks. Paul Frank has played a major role in the im-
plementation and testing of the large, sparse nonlinear programming methods described.
Bill Huffman, my coauthor for many publications and the SOCS software, has been an
invaluable sounding board over the last two decades. Finally, thanks to Jennifer for her
patience and understanding during the preparation of this book.
John T. Belts
Chapter 1
Introduction to Nonlinear
Programming
1.1 Preliminaries
This book concentrates on numerical methods for solving the optimal control problem.
The fundamental principle of all effective numerical optimization methods is to solve
a difficult problem by solving a sequence of simpler subproblems. In particular, the
solution of an optimal control problem will require the solution of one or more finite-
dimensional subproblems. As a prelude to our discussions on optimal control, this chapter
will focus on the nonlinear programming (NLP) problem. The NLP problem requires
finding a finite number of variables such that an objective function or performance index
is optimized without violating a set of constraints. The NLP problem is often referred to
as parameter optimization. Important special cases of the NLP problem include linear
programming (LP). quadratic programming (QP), and least squares problems.
Before proceeding further, it is worthwhile to establish the notational conventions
used throughout the book. This is especially important since the subject matter covers
a number of different disciplines, each with their own notational conventions. Our goal
is to present a unified treatment of all these fields. As a rule, scalar quantities will be
denoted by lowercase letters (e.g., a). Vectors will be denoted by boldface lowercase
letters and will usuallv be considered column vectors, as in
where the individual components of the vector are Xk for fc = 1 , . . . , n. To save space, it
will often be convenient to define the transpose, as in
1
2 CHAPTER 1. INTRODUCTION TO NONLINEAR PROGRAMMING
Let us denote the solution by x* and let us assume x is a guess for the solution. The
basic idea of Newton's method is to approximate the nonlinear function c(x) by the first
two terms in a Taylor series expansion about the current point x. This yields a linear
approximation for the constraint function at the new point x, which is given by
where c'(x) = dc/dx is the slope of the constraint at x. Using this linear approximation,
it is reasonable to compute x, a new estimate for the root, by solving (1.5) such that
c(x) = 0, i.e.,
where
and also
If the new point is an improvement, then it makes sense to repeat the process, thereby
defining a sequence of points x^ ,x^l\x^\... with point (k+l) in the sequence given by
1.3. SECANT METHOD IN ONE VARIABLE 3
For notatioiial convenience, it usually suffices to present a single step of the algorithm, as
in (1.6), instead of explicitly labeling the information at step k using the superscript, no-
tation x^. Nevertheless, it should be understood that the algorithm defines a sequence
of points x p ^°', x' 1 ', x ^ 2 ' , . . .. The sequence is said to converge to x* if
In practice, of course, we are not interested in letting k —> oo. Instead we are satisfied
with terminating the sequence when the computed solution is "close'' to the answer.
Furthermore, the rate of convergence is of paramount importance when measuring the
computational efficiency of an algorithm. For Newton's method, the rate of convergence
is said to be quadratic or, more precisely, q-quadratic (cf. [46]). The impact of quadratic
convergence can be dramatic. Loosely speaking, it implies that each successive estimate
of the solution will double the number of significant digits!
Example 1.1. To demonstrate, let us suppose we want to solve the constraint
where the coefficients 01,02,03 are chosen such that c(O.l) = —0.05, c(0.25) ~ 0, and
c(0.9) = 0.9. Table 1.1 presents the Newton iteration sequence beginning from the initial
guess x = 0.85 and proceeding to the solution at x* = 0.25. Figure 1.1 illustrates the first
three iterations. Notice in Table 1.1 that the error between the computed solution and
the true value, which is tabulated in the third column, exhibits the expected doubling
in significant figures from the fourth iteration to convergence.
So what is wrong with Newton's method? Clearly, quadratic convergence is a very-
desirable property for an algorithm to possess. Unfortunately, if the initial guess is not
sufficiently close to the solution, i.e., within the region of convergence. Newton's method
may diverge. As a simple example, Dennis and Schnabel [46] suggest applying Newton's
method to solve c(x) — arctan(x) = 0. This will diverge when the initial guess x^\ > a,
converge when x^0> < a, and cycle indefinitely if \x^\ — a, where a — 1.3917452002707.
In essence, Newton's method behaves well near the solution (locally) but lacks something
permitting it to converge globally. So-called globalization techniques, aimed at- correcting
this deficiency, will be discussed in subsequent sections. A second difficulty occurs when
the slope c!(x) = 0. Clearly, the correction defined by (1.6) is not well defined in this
case. In fact. Newton's method loses its quadratic convergence property if the slope is
zero at the solution, i.e., c'(x*) = 0. Finally. Newton's method requires that the slope
c'(x) can be computed at every iteration. This may be difficult and/or costly especially
when the function c(x) is complicated.
Notice that this approximation is constructed using two previous iterations, but only
requires values for the constraint function c(x). This expression can be rewritten to give
4 CHAPTER 1. INTRODUCTION TO NONLINEAR PROGRAMMING
Iter. c(x) X IT — Jj
|X T*|
|
where B is the (scalar) secant approximation to the slope. Using this approximation, it
then follows that the Newton iteration (1.6) is replaced by the secant iteration
Figure 1.2 illustrates a secant iteration applied to Example 1.1 described in the pre-
vious section.
1.4. NEWTON'S METHOD FOR MINIMIZATION IN ONE VARIABLE 5
Clearly, the virtue of the secant method is that it does not require calculation of the
slope c'(xk). While this may be advantageous when derivatives are difficult to compute,
there is a downside! The secant method is superlinearly convergent, which, in general,
is not as fast as the quadratically convergent Newton algorithm. Thus, we can expect
convergence will require more iterations, even though the cost per iteration is less. A
distinguishing feature of the secant method is that the slope is approximated using
information from previous iterates in lieu of a direct evaluation. This is the simplest ex-
ample of a so-called quasi-Newton method.
Notice that we cannot use a linear model for the objective because a linear function does
not have a finite minimum point. In contrast, a quadratic approximation to F(x) is the
6 CHAPTER 1. INTRODUCTION TO NONLINEAR PROGRAMMING
simplest approximation that does have a minimum. Now for a; to be a minimum of the
quadratic (1.18), we must have
The derivation has been motivated by minimizing F(x). Is this equivalent to solving
the slope condition F'(x) = 0? It would appear that the iterative optimization sequence
defined by (1.20) is the same as the iterative root-finding sequence denned by (1.6),
provided we replace c(x) by F'(x). Clearly, a quadratic model for the objective function
(1.18) produces a linear model for the slope F'(x). However, the condition F'(x) = 0
only defines a stationary point, which can be either a minimum, a maximum, or a point of
inflection. Apparently what is missing is information about the curvature of the function,
which would determine whether it is concave up. concave down, or neither.
Figure 1.3 illustrates a typical situation. In the illustration, there are two points
with zero slopes; however, there is only one minimum point. The minimum point is
distinguished from the maximum by the algebraic sign of the second derivative F"(x).
Formallv, we have
1.5. NEWTON'S METHOD IN SEVERAL VARIABLES 7
Necessary Conditions:
Sufficient Conditions:
Note that the sufficient conditions require that F"(x*} > 0, defining a strong local
minimizer in contrast to a weak local minimizer. which may have F"(x*) = 0. It is also
important to observe that these conditions define a local rather than a global minimizer.
For the present, let us assume that the number of constraints and variables is the same,
i.e., m = n. Just as in one variable, a linear approximation to the constraint functions
analogous to (1.5) is given by
Thus, each Newton iteration requires a linear approximation to the nonlinear con-
straints c. followed by a step from x to the solution of the linearized constraints at x.
8 CHAPTER 1. INTRODUCTION TO NONLINEAR PROGRAMMING
The scalar term g T p is referred to as the directional derivative along p and the scalar
term pTHp is called the curvature or second directional derivative in the direction p.
It is instructive to examine the behavior of the series (1.33). First, let us suppose
that the expansion is about the minimum point x*. Now if x* is a local minimum, then
the objective function must be larger at all neighboring points, that is, F(x) > F(x*).
In order for this to be true, the slope in all directions must be zero, that is. (g*) p = 0.
which implies we must have
This is just the multidimensional analogue of the condition (1.21). Furthermore, if the
function curves up in all directions, the point x* is called a strong local minimum arid
the third term in the expansion (1.33) must be positive:
A matrix1 that satisfies this condition is said to be positive definite. If there are some
directions with zero curvature, i.e., p T H*p > 0, then H* is said to be positive semidef-
inite. If there are directions with both positive and negative curvature, the matrix is
called indefinite. In summary.
Necessary Conditions:
Sufficient Conditions:
The preceding discussion was motivated by an examination of the Taylor series about
the minimum point x*. Let us now consider the same quadratic model about an arbitrary
1
H* = H(x*) (not the conjugate transpose, as in some texts).
10 CHAPTER 1. INTRODUCTION TO NONLINEAR PROGRAMMING
point x. Then it makes sense to choose a new point x such that the gradient at x is zero.
The resulting linear approximation to the gradient is iust
Just as before, the Newton iteration is denned by (1.29). Since this iteration is based
on finding a zero of the gradient vector, there is no guarantee that the step will move
toward a local minimum rather than a stationary point or maximum. To preclude this,
we must insist that the step be downhill, which requires satisfying the so-called descent
condition
It is interesting to note that, if we use the Newton direction (1.41), the descent condition
becomes
which can only be true if the Hessian is positive definite, i.e., (1.35) holds.
where the new estimate B is computed from the old estimate B. Typically, this calcu-
lation involves a low-rank modification 7£(Ac, Ax) that can be computed from the pre-
vious step:
The usual way to construct the update is to insist that the secant condition
1.7. RECURSIVE UPDATES 11
hold and then construct an approximation B that is "close" to the previous estimate B.
In Section 1.3, the simplest form of this condition (1.15) led to the secant method. In
fact, the generalization of this formula, proposed in 1965 by C. G. Broyden [32], is
which is referred to as the secant or Broyden update. The recursive formula constructs
a rank-one modification that satisfies the secant, condition and minimizes the Frobenius
norm between the estimates.
When a quasi-Newton method is used to approximate the Hessian matrix, as re-
quired for minimization, one cannot simply replace Ac with Ag in the secant update.
In particular, the matrix B constructed using (1.48) is not symmetric. However, there
is a rank-one update that does maintain symmetry, known as the symmetric rank-one
(SRI) update:
where Ag = gfc — g f r ~ ] . While the SRI update does preserve symmetry, it does not
necessarily maintain a, positive definite approximation. In contrast, the update
where
This so-called inverse positive definite secant update is referred to as the DFP update
for its discoverers Da.vidon [43] and Fletcher and Powell [55].
12 CHAPTER 1. INTRODUCTION TO NONLINEAR PROGRAMMING
Even though many recursive updates can be applied directly to the inverse matri-
ces, most practical implementations do not use this approach. When the matrices G
and/or H are singular, the inverse matrices do not exist. Consequently, it is usually
preferable to work directly with G and H. There are at least three issues that must be
addressed by an effective implementation, namely efficiency, numerical conditioning, and
storage. The solution of a dense linear system, such as (1.28) or (1.40), requires O(n3)
operations, compared with the O(n2) operations needed to compute the matrix-vector
product (1.41). However, this penalty can be avoided by implementing the update in
"factored form." For example, the (positive definite) Hessian matrix can be written in
terms of its Cholesky factorization as H — RR . Since the recursive update formulas
represent low-rank modifications to H, it is possible to derive low-rank modifications to
the factors R. By updating the matrices in factored form, the cost of computing the
search direction can be reduced to O(n2) operations, just as when the inverse is recurred
directly. Furthermore, when the matrix factorizations are available, it is also possible to
deal with rank deficiencies in a more direct fashion. Finally, when storage is an issue,
the matrix at iteration k can be represented as the sum of L quasi-Newton updates to
the original estimate B0 in the form
where the vectors U; and v» denote information from iteration i. If the initial estimate
BQ requires relatively little storage (e.g., is diagonal), then all operations involving the
matrix Bj. at iteration k can be performed without explicitly forming the (dense) matrix
Bfe. This technique, called a limited memory update, only requires storing the vectors u
and v over the previous L iterations.
We have motivated the use of a recursive update as a way to construct Jacobian
and/or Hessian information. However, we have not discussed how fast an iterative se-
quence will converge when the recursive update is used instead of the exact information.
All of the methods that use a recursive update exhibit superlinear convergence pro-
vided the matrices are nonsingular. In general, superlinear convergence is not as fast as
quadratic convergence. One way to measure the rate of convergence is to compare the
behavior of a Newton method and a quasi-Newton method on a quadratic function of n
variables. Newton's method will terminate in one step, assuming finite-precision arith-
metic errors are negligible. In contrast, a quasi-Newton method will terminate in at most
n steps, provided the steplength a is chosen at each iteration to minimize the value of
the objective function at the new point F(x) = F(x + ap). The process of adjusting a
is called a line search and will be discussed in Section 1.11.
Just as in the unconstrained case, these conditions do not distinguish between a point
that is a minimum, a maximum, or simply a stationary point. As before, we require
conditions on the curvature of the objective. Let us define the Hessian of the Lagmngian
to be
for any vector v in the constraint tangent space. If one compares (1.35) with (1.61),
an important difference emerges. For the unconstrained case, we require that the curva-
ture be positive in all directions p. However, (1.61) applies only to directions v in the
constraint tangent space.
Example 1.2. To fully appreciate the meaning of these conditions, consider the
simple example problem with two variables and one constraint illustrated in Figure 1.5.
Let us minimize
The solution is at x* = (1,1). Now for this example, the Jacobian is just G =
Vc;T — (1,1), which is a vector orthogonal to the constraint. Consequently, if we choose
v = (—a, a) for some constant a ^ 0. the vector v is tangent to the constraint, which
14 CHAPTER 1. INTRODUCTION TO NONLINEAR PROGRAMMING
can be readily verified since Gv = (1)(—a) + (l)(a) = 0. At x*, the gradient is a linear
combination of the constraint gradients, i.e., (1.58) becomes
is clearly positive.
Notice that, at the optimal solution, the gradient vector is orthogonal to the con-
straint surface, or equivalently that the projection of the gradient vector onto the con-
straint surface is zero. A second point is also illustrated in Figure 1.5, demonstrating
that the projection of the gradient is nonzero at the suboptimal point. Apparently then,
there is a matrix Z that projects the gradient onto the constraint surface. This implies
that an equivalent form of the necessary condition (1.56) is to require that the projected
gradient be zero, i.e.,
In a similar fashion, one can define an equivalent form of the sufficient condition (1.61)
in terms of the projected Hessian matrix
In other words, we require the projected Hessian matrix (1.63) to be positive definite.
Notice that the projection matrix Z has n rows and nj = n — m columns. We refer to
Other documents randomly have
different content
School of 42 St. Roch—a small figure
Perugino £6 10s.
Paduanino 43 Head of a duchess of Medicis—a
fragment £1 15s.
School of 44 Saints invoking Christ—two
Giotto illuminated miniatures £4 10s.
School of Titian 45 The Virgin and Child, on a
grassy bank, gathering flowers £3 15s.
School of 46 The Pentecost. A beautiful
Giotto miniature, on vellum, with rich
border £8 15s.
School of 47 The Crucifixion, with Saints. A
Giotto beautiful miniature, on vellum,
with rich arabesque border £4 14s. 6d.
School of Titian 48 Portrait of a Lady of the Medicis
Family: Pellegrina, daughter of
Bianca Capello, in a richly
ornamented dress £4 14s. 6d.
A. del Sarto 49 The Resurrection. An interesting
small work in the Master's first
manner. From the de Angelis
Gallery, at Sienna £4 14s.
C. Maratti 50 The Holy Family £3 3s.
Bronzino 51 The Virgin and Child, with St.
Joseph and St. John. A very
grand and beautiful design—
circular, on panel [£21 0s. 0d.]
G. da Carpi 52 The Virgin, in a crimson and
blue dress, seated, with the
Infant in her lap, before a
sculptured portico; a green
drapery suspended above—
circle on panel. The Orsini Arms
on the frame £141 15s.
Luigi Agresti 53 The Last Supper. Very richly
coloured, with the engraving £6
School of 54 The Virgin and Child, enthroned,
Brescia with saints and angels in
adoration £4
F. Vanni 55 The repose of the Holy Family—
small £2
Schedone 56 The Virgin and Child £1 13s.
School of 57 A female saint, holding a salver
Parma of fruit—very elegant £4 4s.
School of 58 The Holy Family, with St. Francis
Ferrara and St. Jerome £9 9s.
Guardi 59 A view on a canal, at Venice,
with figures £11 0s. 6d.
Guardi 60 A view on the grand canal—the
companion £11 0s. 6d.
Scorza, of 61 A pastoral landscape
Genoa £1 6s.
S. Rosa 62 A romantic bay scene, with
figures—evening £4 10s.
Serani 63 St. Cecilia, playing on the viol
da gamba £5 7s. 6d.
Testaferrata 64 A Roman piper £1 1s.
Antonilez di 65 St. Raymond of Penaforte. From
Serabia the Standish Gallery £3 13s. 6d.
Montelinez di 66 St. Anthony, seated reading,
Serabia near a chapel, with
mountainous background. From
the Standish Gallery £2 2s.
Zurbaran 67 The Madonna of Mercy—four
figures kneeling round her. From
the Standish Gallery [£2 15s.]
Murillo 68 The vision of St. Augustine of £199 10s.
Canterbury: the saint is washing
the feet of the Saviour, who
appears in the likeness of a
pilgrim; from his mouth proceed
the words "Magne Pater
Augustine tibi commendo
Ecclesiam meam." This fine
gallery picture was purchased
from Don Julian Williams, by Mr.
Standish, for £600, at Seville, in
1825; it was originally painted
for the nuns of San Leandro
Order of St. Austen, and sold by
them during the troubles caused
by the army of Soult, in 1810,
to Dr. Manuel Real, from whom
it passed to Don J. Williams.
The picture is mentioned in the
work of Herrera and d'Aviles
Guia de Seville, 1832
Velazquez 69 Portrait of a Cardinal, seated,
holding a book, the chair
surmounted by shields of arms.
Full of dignified character. From
Cardinal Fesch's gallery £4 4s.
School of 70 La Madonna Addolorata, in a
Cologne crimson dress, a light-coloured
robe. A very dignified figure. A
fragment [£1 10s.]
Wilhelm, of 71 The Marriage of St. Catherine
Cologne with St. Agnes. They are in the
foreground of a landscape, with
buildings in the distance. From
M. Wyer, of Cologne £14 3s. 6d.
Van der Maire 72 St. Catherine, presenting a £5 15s. 6d.
devotee. An interesting
fragment
Van Eyck 73 A fine dyptic, with the
Annunciation: the Virgin
kneeling, the Angel in a rich
dress, holding a sceptre:—the
portrait of the donor outside.
From the Collection of M. Wyer,
of Cologne £39 18s.
Henri Blaes La 74 A tryptic, with the Virgin and
Civetta Child in the centre, seated, in a
landscape; St. Christopher and
St. Anthony on the wings; an
owl, the emblem of the Master.
From the Collection of M. Wyer,
of Cologne £17 6s. 6d.
Dionysius 75 The Crucifixion: The Virgin and
Calcar St. John weeping, with
landscape background £8 8s.
School of 76 St. Natalitia, seated, holding a
Hemmelinck book, on which is a hand, cut
off; with architectural
background. From the same
collection £12 1s. 6d.
Matth. 77 Portrait of Philip le Bel, in a
Guinendenwald crimson dress and black hat,
wearing the collar of the Golden
Fleece £6.
Van der Goes 78 The Virgin and Child,
enthroned; a damask drapery
behind; landscape background
seen on each side £22 1s.
Lucas van 79 A very small female head—a
Leyden fragment 18s.
Martin Schoen 80 A tryptic: the Crucifixion, with £12 1s. 6d.
the figures carved in wood, and
painted background in the
centre; the wings painted with
the six stations; carved canopy
work over the centre; the
descent from the Cross painted
on the outside
Sustermans 81 Portrait of Galileo £4 10s.
Sustermans 82 Portrait of a Florentine lady £2 4s.
Van Dyck 83 The Adoration of the Magi—a
sketch in grisaille £2 8s.
Van Dyck 84 Portrait of the Earl of Strafford,
in a black dress. Purchased from
the Earl of Mar's collection, in
1805 £5 5s.
Teniers 85 A landscape, with peasants and
poultry near a cottage—upright
—on copper £3 7s. 6d.
Camphuyzen 86 A farm, with cattle, and a man
milking a cow near a well. Very
richly coloured £6 10s.
Jan Steen 87 Portrait of a Burgomaster £5 15s.
Poelemberg 88 The Riposo of the Holy Family,
under a ruined building £2 10s.
Wouvermans 89 Travellers, reposing under a
sunny bank, near a pool of
water £33 12s.
Van Falens 90 Camp suttlers, with horsemen
and numerous figures. From the
Collection of Sir James Stuart £5 10s.
Swaneveldt 91 A study of ruins—on paper £1 2s.
Watteau 92 A fête champêtre £1 10s.
Rigaud 93 Portrait of a French lady,
holding a row of pearls £3 10s.
Venetian 94 Portrait of the admirable
Crichton, in black dress, seated
holding a sword and a book;
with long inscription. Dated
1581, with the engraving £13 2s. 6d.
Roman School 95 Portrait of the Cardinal of York,
in his robes. Purchased at his
villa, at Frascati £1 10s.
Sir P. Lely 96 Portrait of the Countess of
Southesk, (la belle Hamilton) in
a white satin dress, seated,
holding a viol da gamba, in a
landscape, from the collection
of C.R. Sharpe, Esq. [£7 17s. 6d.]
Sir Joshua 97 A very small head of a lady
Reynolds 15s.
Anthony 98 Henselope Burn 14s.
Andrew Wilson 99 The Cascatelle, at Tivoli, with
shepherds and goats in the
foreground, admirably painted £33 12s.
J.M.W. Turner, 100 A farm in the Highlands
R.A. £2 8s.
Rev. J. 101 The Trosacks. A beautiful
Thompson finished study, given by the
artist to Mr. Dennistoun in 1829 £3
J.M.W. Turner, 102 Fishing boats caught in a squall
R.A. £8 15s.
Millais, A.R.A. 103 A cottage barn, in Essex: a
sketch of figures on the back £4 10s.
The total amount realised at the sale was £1398 15s. 6d.
AUTHOR’S PREFACE
(1851)
D
URING nearly one hundred and ninety years, five Dukes of
Urbino well and ably discharged the duties of their station,
comparatively exempt from the personal immoralities of their
age. The rugged frontier of their highland fief had, in that time,
been extended far into the fertile March of Ancona, until it embraced
a compact and influential state. Saving their subjects, by a gentle
and judicious sway, from the wild ferments that distracted
democratic communities, and from the yet more dire revolutions
which from time to time convulsed adjoining principalities, they so
cultivated the arts of war, and so encouraged the pursuits of peace,
that their mountain-land gained a European reputation as the best
nursery of arms, their capital as the favoured asylum of letters. That
glory has now become faint; for the writers by whom it has been
chiefly transmitted belong not to the existing generation, and
command few sympathies in our times. But the echoes of its fame
still linger around the mist-clad peaks of Umbria, and in the
dilapidated palace-halls of the olden race. To gather its evanescent
substance in a form not uninteresting to English readers, is the
object of the present attempt. Should it be so far successful as to
attract some of his countrymen to the history, literature, and arts of
Italy, they will not, perhaps, be ungrateful to the humble pioneer
who has indicated a path to literary treasures hitherto inadequately
known to them. For such an undertaking he possesses no
qualification, beyond a sincere interest in the past ages of that sunny
land, and a warm admiration for her arts during their epoch of
brilliancy. But a residence there of six years has afforded him
considerable opportunities of collecting materials for this work, which
he has been anxious not to neglect.
A great portion of the duchy of Urbino, including its principal towns,
has been thrice visited, and nearly every accessible library of Central
Italy has been examined for unedited matter. To these researches,
time and labour have been freely given; and in the few instances
when his attempts were foiled by jealousy or accident, the author
has generally had the satisfaction of believing that success would
have been comparatively unproductive. To this, two exceptions
should be mentioned. He was prevented by illness from recently
visiting the libraries or archives at Venice; and the Barberini Library
at Rome has been entirely closed for some years, in consequence of
a disgraceful pillage of its treasures. Should the latter be again made
accessible, the MSS. amassed by the Pontiff under whom Urbino
devolved to the Church, and by his nephews, its two first Legates,
can hardly fail to throw much light upon the duchy. The invaluable
treasures of the Vatican archives have been to him, as to others, a
sealed book; but the Urbino MSS. in the Vatican Library, those of the
Oliveriana at Pesaro, and of the Magliabechiana at Florence, have
afforded copious sources of original information, and have supplied
means for rectifying omissions and errors of previous writers. Some
of these materials had been freely drawn upon by Muzio, Leoni, and
Baldi, biographers of the early dukes of Urbino, who have not,
however, by any means exhausted the soil; the amount that
remained for after inquirers may be estimated from the single
instance of Sanzi's almost unnoticed rhyming Chronicle of Duke
Federigo, in about 26,000 lines.
The reigns of Dukes Federigo, Guidobaldo I., and Francesco Maria I.,
from 1443 to 1538, formed the brightest era of Urbino, and included
the most stirring period of Italian history, the golden age of Italian
art; but our regnal series would be incomplete without Dukes
Guidobaldo II. and Francesco Maria II., who prolonged the
independence of the duchy until 1631, when it lapsed to the Holy
See. Its history thus naturally divides itself into five books,
representing as many reigns; yet, as these sovereigns were of two
different dynasties, it will be convenient to consider separately the
origin of each, and the influence which they respectively exercised
on literature and the fine arts, thus giving matter for four additional
books. In Book First of these we shall briefly sketch the early
condition of the duchy, with the establishment of the family of
Montefeltro as Counts, and eventually as Dukes, of Urbino; but,
regarding Duke Federigo as the earliest of them worthy of detailed
illustration, we shall, in Book Second, with his succession, enter
upon the immediate scope of our work.
may yet admit the truth of this suggestion. May they never
personally realise the adage, that those who originate revolutions
reap all their evils, without living to share their fruits!
Few things are more baffling to students of history than the true
worth of money in different states and ages, and its relative value in
reference to our own standards. It is impossible to over-estimate the
convenience which tables, showing the fluctuations of currency and
prices among different nations, would afford; but the difficulties of
completing them may perhaps be insuperable. In order to supply
this desideratum, however imperfectly, a few observations are here
submitted.
In considering the value of money at different periods, a variety of
circumstances must be kept in view. There are, however, four
elements to be embraced by all calculations for such a purpose: (1)
the comparative weight of the coinage; (2) the respective amounts
of alloy introduced into the standard of precious metals; (3) the
effect produced on gold and silver value by the discovery of
America; (4) the fluctuations in prices of commodities. The last of
these elements includes and depends upon the others, so that a
tariff of prices at various times might be practically sufficient for the
object contemplated. The impediments, however, to obtaining such a
tariff are apparently insurmountable. Statistical facts, incidentally
mentioned by historians, or gleaned from original documents, must
be received with large allowance. Articles of costly luxury in one age
became abundant in another, and are at all times affected by local or
temporary causes. Quality was also variable; horses, oxen, sheep,
and poultry, reared or fed in rude times or uncultivated districts,
cannot fairly be compared with those perfected by care and
expense; the same may be said of wines, fruits, clothing; even land
is saleable according to its condition, fertility, or situation. The test
usually resorted to in such inquiries is corn; but weights and
measures, seldom uniform, are with difficulty ascertained at remote
periods, while exceptional prices are more frequently noted than
average ones, by observers prone to record striking events rather
than every-day facts. There are, however, some apparently admitted
data not altogether unavailable for our immediate purpose.
During the period embraced by our memoirs of Urbino, the standard
of value prevalent in most parts of Italy was the golden florin or
ducat. Of these probably equivalent terms, the former was generally
employed in Central Italy, the latter in Lombardy. According to
Villani, the florin of Florence, in 1340, weighed 72 grains of pure
gold, 24 carats fine. Sismondi, in referring to a period about a
century later, estimates its weight at ⅛ of an ounce, or 60 grains.
Orsini reckons it, in 1533, at 70 grains, 22 carats fine. On the whole,
it appears, from Cibrario and other authorities, that this coin, and its
successor the zecchino, have maintained an almost uniform weight
down to the present time. Assuming that gold in Italy had then the
same coinage-value as in England, it appears from calculations,
founded upon Fleetwood's data, that the florin was, at these various
periods, equivalent in contemporary English coin to 3s. 6d., 4s. 8d.,
and 5s. 10d. Again, the ducat of Venice is estimated by Daru at 4
franks in 1465, at 4⅓ in 1490, and by Sanuto at 4s. English in 1500.
Riposati, in a careful analysis of the coinage of Gubbio, proves that
the conventional Urbino florin of 1450 should have contained
63434/59 grains of silver, besides alloy, which would at that time have
yielded 3s. 9d. English, or at our present pure silver value (5s. 6d. to
the ounce) 7s. 3¼d.
It would follow, from these several opinions, that the florin or ducat
of Italy, in the fifteenth century, was equal to from 3s. 6d. to 4s. 6d.
in contemporary English circulation, which disposes of two elements
for our calculation. The remaining two must have been inadequately
kept in view by Cibrario, Ricotta, and Audin, who respectively value
the florin of 1400 as now worth 16⅔ francs, that of 1490 at 14
francs, and that of 1500 at 12 francs; while in the Library of
Entertaining Knowledge it is set down at 10s. English in 1480. But if
we assume the analogy of English prices as collected by Fleetwood,
the result will be very different. From these it appears that an
average cost of wheat and oats per quarter, in the fifteenth century,
was about 5s. 2d. and 2s. 6d., while the wages of labourers and
artisans were respectively 3½d. and 4½d. a day. Accordingly, if corn
be taken as the test, money was then ten times beyond its modern
value; while, if we include labour and luxuries, the actual
depreciation must appear much greater. We are greatly encouraged
to find such an inference not very different from that adopted by
three recent and important authorities. Prescott values the Spanish
ducat of 1490 at 39s. 4d., and Macaulay states that of Florence in
1340 at 40s. sterling, while Sismondi calculates it at about 48 francs.
On the whole, then, we venture to assume that the Italian ducat or
florin of the fifteenth century was nearly equal to the present
Spanish dollar, and that it would have purchased about twelve times
the amount of necessaries and luxuries which that coin now
represents in England—a discrepancy of course lessened in the next
and each succeeding age, especially as the precious metals
continued to flow in from the new hemisphere. This estimate is,
however, offered with great deference, and only as a general
approximation to the truth, by no means applicable to numerous
exceptional cases.[9]
BOOK FIRST
OF URBINO AND ITS EARLY COUNTS
CHAPTER I
Topography of the Duchy of Urbino—Origin of the Italian
communities—Their civil institutions and military system—Their
principle of liberty—Political divisions of Romagna; opposed to
modern speculations regarding centralization 3
CHAPTER II
Origin of the Counts of Montefeltro, and of their sovereignty in
Urbino and the surrounding country—Their early genealogy—
Guido Count of Urbino—Antonio Count of Urbino 22
CHAPTER III
Guidantonio Count of Urbino—The Ubaldini—Oddantonio Count
of Urbino—Is made Duke—His dissolute habits and speedy
assassination 42
BOOK SECOND
OF FEDERIGO DI MONTEFELTRO, COUNT AND
SECOND DUKE OF URBINO
CHAPTER IV
The birth of Count Federigo—Condition of Italy—His marriage
and early military service—The Malatesta his inveterate foes—
He takes S. Leo—Is invested with Mercatello 61
CHAPTER V
Count Federigo succeeds to Urbino and acquires Fossombrone
—His connection with the Sforza family, whereby he incurs
excommunication—His campaign in the Maremma—Loses his
eye in a tournament 85
CHAPTER VI
Count Federigo enters the Neapolitan service—His two
campaigns in Tuscany—Fall of Constantinople—Peace of Lodi—
Nicholas V.—The Count's fruitless attempt at reconciliation with
Sigismondo Pandolfo Malatesta, followed by new feuds with him
—Death of his Countess Gentile 102
CHAPTER VII
Count Federigo's domestic life—His second marriage—New war
for the Angevine succession to Naples—Battle of San Fabbiano
—Conclusion of the war—Humiliation of the Malatesta 120
CHAPTER VIII
Count Federigo's home administration and court—Description of
his palace and library at Urbino—His other palaces—The
resources of his state 147
CHAPTER IX
Count Federigo's varied engagements—Battle of La Molinella—
Death and character of his enemy Malatesta—Affairs of Rimini 177
CHAPTER X
Birth of Prince Guidobaldo—Count Federigo captures Volterra—
Is again widowed—Receives the Garter and the Ermine—Is
made Duke of Urbino—His patronage of learned men 207
CHAPTER XI
The Duke of Milan assassinated—Count Girolamo Riario—The
Pazzi conspiracy—Duke Federigo's campaigns in Tuscany—
Progress of the Turks 233
CHAPTER XII
The war of Ferrara, and the death of Duke Federigo—His
258
character and portraits
BOOK THIRD
OF GUIDOBALDO DI MONTEFELTRO, THIRD DUKE OF URBINO
CHAPTER XIII
The early promise of Duke Guidobaldo I.—Count Girolamo
Riario assassinated—The Duke's marriage—Comparative quiet
of Italy 295
CHAPTER XIV
State of the papacy at the election of Alexander VI.—His
election, character, and children—The aspect of Italy at the
close of her golden age—The disputed succession of Naples
reopened—Character and views of Charles VIII.—Proposed
league to oppose him frustrated—State of the Roman
Campagna—The old and new military systems in Italy 315
CHAPTER XV
Italy ill prepared for the French invasion—Duke Guidobaldo sent
against the Orsini—Lucrezia Borgia's second marriage—Descent
of Charles VIII.—He reaches Naples and retreats—Battle of the
Taro—The Duke engaged in the Pisan war—Is taken prisoner by
the Orsini and ransomed 341
CHAPTER XVI
The crimes and ambition of the Borgia—Murder of the Duke of
Gandia—Duke Guidobaldo's expeditions against Perugia and
Tuscany—He adopts Francesco Maria della Rovere as his heir—
Louis XII. succeeds to Charles VIII., and to his views upon Italy
—Cesare Borgia created Duke Valentino—Duke Guidobaldo at
Venice 363
CHAPTER XVII
The condition of Romagna—Cesare Borgia overruns and seizes
upon it—The spirit of his government—Naples invaded by Louis,
and handed over to Spain—Lucrezia Borgia's fourth marriage 379
CHAPTER XVIII
Duke Guidobaldo's retired life—Cesare Borgia surprises and
seizes Urbino—The Duke's flight—The diet of La Magione—
Rising in the Duchy, and his return—He again retires 399
APPENDICES
A.D. PAGE
The duchy of Urbino, how composed 3
Its characteristic features, and traditional
topography 4
Origin of Italian communities 4
Rise of the Guelph and Ghibelline factions 5
Counts of the empire 6
Republics established in Italy 7
Opinions regarding their spirit 8
The seigneurs attain to sovereignty 10
Practical distinction of Guelph and Ghibelline 11
Early military system 12
Origin and influence of free companies 14
The term Republic misapplied 15
Their principle of liberty examined 16
Political divisions of Romagna and La Marca in
the fifteenth century 18
Opposed to modern speculations and the aims
of Young Italy 19
Mariotti's admissions regarding freedom 20
CHAPTER II
CHAPTER III
CHAPTER IV
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
ebookname.com