Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia...

16
Teoria e metodi dell’ottimizzazione Laurea Magistrale in Matematica - a.a. 2015/16 Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 1 / 10

Transcript of Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia...

Page 1: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

Teoria e metodi dell’ottimizzazione

Laurea Magistrale in Matematica - a.a. 2015/16

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 1 / 10

Page 2: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

Basic data

Title: Teoria e metodi dell’ottimizzazioneSemester II - 6 CFU (42 h)

Webpage: http://www.di.unipi.it/˜bigig/dida/tmo.html

Instructor: Giancarlo Bigi ([email protected])

Topics: nonlinear optimization/programming, equilibria (in finite dimension)

Prerequisites: linear algebra, basics of topology, multivariate calculus

Material: lecture notes + detailed references

Exam: oral test or seminar&report

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 2 / 10

Page 3: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

Optimization

: a bit of history

Nothing at all takes place in the universe in whichsome rule of maximum or minimum does not appear

(L.Euler, 1744)

Our mathematical optimization framework

find minima and/or maxima of f : Rn → R over some X ⊆ Rn

X = Rn −→ unconstrained optimization

X any (convex) subset of Rn −→ constrained optimization↖

X explicitly described by algebraic inequalities and/or equalities

– f smooth and/or convex

(nonlinearities in f and/or in [the description of] X )

Optimization rooted in ancient timesproblems of geometrical nature [Euclid (300bc), Apollonius (200bc) ....]

Calculus paved the way to pioneersP.de Fermat (1629), G.W.von Liebniz (1684), I.Newton (1671)

L.Euler (1755), J.L.Lagrange (1797)

C.F.Gauss (1794), A.M.Legendre (1805), A.L.Cauchy (1847)

Insights from economicsdiminishing returns [T.R.Malthus, D.Ricardo et al. (1815)] −→ convexity

individual utility maximization [A.A.Cournot (1838), L.Walras (1874)] −→ equilibria

First textbook in 1917 (by H.Hancock)

Springer encyclopedia in 2009: 4646 (two-column) pages!

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 3 / 10

Page 4: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

Optimization: a bit of history

Nothing at all takes place in the universe in whichsome rule of maximum or minimum does not appear

(L.Euler, 1744)

Our mathematical optimization framework

find minima and/or maxima of f : Rn → R over some X ⊆ Rn

X = Rn −→ unconstrained optimization

X any (convex) subset of Rn −→ constrained optimization↖

X explicitly described by algebraic inequalities and/or equalities

– f smooth and/or convex

(nonlinearities in f and/or in [the description of] X )

Optimization rooted in ancient timesproblems of geometrical nature [Euclid (300bc), Apollonius (200bc) ....]

Calculus paved the way to pioneersP.de Fermat (1629), G.W.von Liebniz (1684), I.Newton (1671)

L.Euler (1755), J.L.Lagrange (1797)

C.F.Gauss (1794), A.M.Legendre (1805), A.L.Cauchy (1847)

Insights from economicsdiminishing returns [T.R.Malthus, D.Ricardo et al. (1815)] −→ convexity

individual utility maximization [A.A.Cournot (1838), L.Walras (1874)] −→ equilibria

First textbook in 1917 (by H.Hancock)

Springer encyclopedia in 2009: 4646 (two-column) pages!

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 3 / 10

Page 5: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

Contents: a magic blend

Mixing (variable doses):

– Theory

convex analysisoptimality conditionsduality

– Algorithms

unconstrained optimization & nonlinear least squaresconstrained optimizationequilibria

– Applications

a never ending list in so many areas(physics, chemistry, statistics, engineering, transportation, computer graphics

biology, life sciences, logistics, finance, economics and social sciences, etc.)

plus strong ties with numerical analysis, calculus of variations, control theory ...

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 4 / 10

Page 6: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

Contents: a magic blend

Mixing (variable doses):

– Theory

convex analysisoptimality conditionsduality

– Algorithms

unconstrained optimization & nonlinear least squaresconstrained optimizationequilibria

– Applications

a never ending list in so many areas(physics, chemistry, statistics, engineering, transportation, computer graphics

biology, life sciences, logistics, finance, economics and social sciences, etc.)

plus strong ties with numerical analysis, calculus of variations, control theory ...

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 4 / 10

Page 7: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

The great watershed in optimization

Infact the great watershed in optimization isn’t betweenlinearity and nonlinearity, but convexity and nonconvexity

(R.T.Rockafellar, SIAM Review 1993)

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 5 / 10

Page 8: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

Convexity versus nonconvexity

−5−4

−3−2

−10

12

34

5

−5

0

5

0

5

10

15

20

25

30

35

40

45

50

x

x2+y

2

y

local minimum ≡ global minimum

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 6 / 10

Page 9: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

Convexity versus nonconvexity

−5−4

−3−2

−10

12

34

5

−5

0

5

0

5

10

15

20

25

30

35

40

45

50

x

x2+y

2

y

local minimum ≡ global minimum

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 6 / 10

Page 10: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

Convexity versus nonconvexity

00.1

0.20.3

0.40.5

0.60.7

0.80.9

1

00.1

0.20.3

0.40.5

0.60.7

0.80.9

1

−1

−0.9

−0.8

−0.7

−0.6

−0.5

−0.4

−0.3

−0.2

−0.1

0

x

−cos(9 π ((x−0.5)2+(y−0.5)

2))

2 exp(−((x−0.5)

2+(y−0.5)

2)/.30)

y

plenty of local minimaa unique global minimum

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 7 / 10

Page 11: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

Convexity versus nonconvexity

00.1

0.20.3

0.40.5

0.60.7

0.80.9

1

00.1

0.20.3

0.40.5

0.60.7

0.80.9

1

−1

−0.9

−0.8

−0.7

−0.6

−0.5

−0.4

−0.3

−0.2

−0.1

0

x

−cos(9 π ((x−0.5)2+(y−0.5)

2))

2 exp(−((x−0.5)

2+(y−0.5)

2)/.30)

y

plenty of local minimaa unique global minimum

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 7 / 10

Page 12: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

Convexity versus nonconvexity

0

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

0

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

−1

−0.5

0

x

−cos(9 π ((x−0.5)2+(y−0.5)

2))

2 exp(−((x−0.5)

2+(y−0.5)

2)/.30)

y

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 8 / 10

Page 13: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

A sample of applications

– Transportationtraffic over networks and road pricing

– Economics and financeoligopolistic and spatial price markets

portfolio selection and risk management

growth models and analysis of economic indicators

– Physics and chemistryconfiguration of molecules

estimate of physical parameters

laws of reflection

– Computer sciencepoint pattern matching

supervised classification

– Information technology and telecommunicationspower allocation in radio systems

cloud computing

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 9 / 10

Page 14: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

Traffic over a transportation network

Predict the steady distribution of traffic over a network (N,A)

Origin–Destination pairs: s ∈ OD ⊆ N × N with a traffic demand ds > 0

The travel time on each arc a ∈ A depends on the total flow on a

o1 d1

o2

d2

Optimization point of view

the management of the network is centralized(a unique decision-maker)

minimize

the total travel time

or

the maximum travel time of OD pairs

or

........

Multi-agent point of view

no central management

each user aims at minimizing its own travel time(the outcome for each one depends also on the choices of the others)

concepts of equilibrium come into play[J.F.Nash (1950), G.J.Wardrop (1952)]

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 10 / 10

Page 15: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

Traffic over a transportation network

Predict the steady distribution of traffic over a network (N,A)

Origin–Destination pairs: s ∈ OD ⊆ N × N with a traffic demand ds > 0

The travel time on each arc a ∈ A depends on the total flow on a

o1 d1

o2

d2

Optimization point of view

the management of the network is centralized(a unique decision-maker)

minimize

the total travel time

or

the maximum travel time of OD pairs

or

........

Multi-agent point of view

no central management

each user aims at minimizing its own travel time(the outcome for each one depends also on the choices of the others)

concepts of equilibrium come into play[J.F.Nash (1950), G.J.Wardrop (1952)]

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 10 / 10

Page 16: Teoria e metodi dell’ottimizzazionebigig/dida/tmo/1516/presentazione-tmo.pdfSpringer encyclopedia in 2009: 4646 (two-column) pages! Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione

Traffic over a transportation network

Predict the steady distribution of traffic over a network (N,A)

Origin–Destination pairs: s ∈ OD ⊆ N × N with a traffic demand ds > 0

The travel time on each arc a ∈ A depends on the total flow on a

o1 d1

o2

d2Optimization point of view

the management of the network is centralized(a unique decision-maker)

minimize

the total travel time

or

the maximum travel time of OD pairs

or

........

Multi-agent point of view

no central management

each user aims at minimizing its own travel time(the outcome for each one depends also on the choices of the others)

concepts of equilibrium come into play[J.F.Nash (1950), G.J.Wardrop (1952)]

Giancarlo Bigi (di.unipi.it) Teoria e metodi dell’ottimizzazione Pisa, 22 Settembre 2015 10 / 10