Portfolios that Contain Risky Assets 17: Fortune s Formulas
|
|
- Ilene Johnston
- 5 years ago
- Views:
Transcription
1 Portfolios that Contain Risky Assets 7: Fortune s Formulas C. David Levermore University of Maryland, College Park, MD Math 420: Mathematical Modeling April 2, 208 version c 208 Charles David Levermore
2 Portfolios that Contain Risky Assets Part II: Stochastic Models. Independent, Identically-Distributed Models 2. Growth Rate Mean and Variance Estimators 3. Law of Large Numbers (Kelly) Objectives 4. Kelly Objectives for Markowitz Portfolios 5. Central Limit Theorem Objectives 6. Optimization of Mean-Variance Objectives 7. Fortune s Formulas 8. Utility Function Objectives
3 Fortune s Formulas Introduction 2 Efficient Frontier 3 Parabolic Objectives 4 Quadratic Objectives 5 Reasonable Objectives 6 Comparisons Objectives 7 Seven Lessons Learned
4 Introduction We now consider some settings in which the optimization problem can be solved analytically. Specifically, we will derive explicit formulas for the solutions to the maximization problems for the family of parabolic objectives Γp χ (f) = µ rf + m T f 2 ft Vf χ f T Vf, (.a) the family of quadratic objectives Γq χ (f) = µ rf + m T f ( 2 µrf + m T f ) 2 2 ft Vf χ f T Vf, (.b) and the family of reasonable objectives Γ χ r (f) = log ( + µ rf + m T f ) 2 ft Vf χ f T Vf, (.c) considered over their natural domains of allocations f for unlimited leverage portfolios with one risk-free asset.
5 Introduction Recall that: µ rf is the return on the risk-free asset; m is the sample excess return mean vector, which is given in terms of the sample return mean vector m by m = m µ rf ; V is the sample return covariance matrix; χ is the nonnegative caution coefficient chosen by the investor. Recall too that m and V are computed from a return history {r(d)} D d= and a choice of positive weights {w(d)} D d= that sum to by m = D w(d) r(d), V = d= D w(d) ( r(d) m ) ( r(d) m ) T. d=
6 Introduction In the previous lecture we saw that the maximizer f for such a problem will correspond to a point (σ, µ ) on the efficient frontier. Moreover, we saw that (σ, µ ) is the point in the σµ-plane where the level curves of the objective are tangent to the efficient frontier. While this geometric picture gave insight into how optimal portfolio allocations arise, we have not yet computed them. The explicit formulas derived in this lecture for the maximizer f will confirm the general picture developed in the previous lecture. They will also give insight into the relative merits of the different families of objectives in (.). In particular, the maximizers when χ = 0 give different realizations of the Kelly Criterion so-called fortune s formulas. The maximizers when χ > 0 will be corresponding fractional Kelly strategies. We will derive and analyze these formulas after reviewing the efficient frontier for unlimited leverage portfolios with one risk-free asset.
7 Efficient Frontier Recall that for unlimited leverage portfolios without risk-free assets the frontier is the hyperbola in the right-half of the σµ-plane given by ( ) σ = σ 2 µ 2 µmv mv +, (2.2a) ν as where the so-called frontier parameters σ mv, µ mv, and ν as are given by σmv 2 = T V, µ mv = T V m T V, (2.2b) νas 2 = m T V m (T V m) 2 T V. This so-called frontier hyperbola has vertex (σ mv, µ mv ) and asymptotes µ = µ mv ± ν as σ for σ 0. The positive definiteness of V insures that σ mv > 0 and ν as > 0.
8 Efficient Frontier If we introduce one risk-free asset with risk-free return µ rf < µ mv then the efficient frontier becomes the tangent half-line given by µ = µ rf + ν tg σ for σ 0, (2.3a) where the slope is ν tg = m T V m ( ) = ν µmv µ 2 as + rf. (2.3b) ν as σ mv This slope is the so-called Sharpe ratio of the efficient frontier. Remark. The Sharpe ratio of any portfolio with return mean µ and volatility σ is defined as µ µ rf. σ Clearly ν tg is the Sharpe ratio of every portfolio on the efficient frontier (2.3a). Moreover, ν tg is the largest possible Sharpe ratio for any portfolio.
9 Efficient Frontier The efficient frontier (2.3a) is tangent to the frontier hyperbola (2.2a) at the point (σ tg, µ tg ) where ( ) σ tg = σ νas σ 2 mv + mv, µ µ mv µ tg = µ mv + ν as 2 σmv 2. rf µ mv µ rf The unique tangency portfolio associated with this point has allocation f tg = σ 2 mv µ mv µ rf V m. (2.4) Every portfolio on the efficient frontier (2.3a) can be viewed as holding a position in this tangency portfolio and a position in a risk-free asset.
10 Efficient Frontier We can select a particular portfolio on this efficient frontier by identifying an objective function to be maximized. In subsequent sections we derive and analyze explicit formulas for the maximizers for each family member of the parabolic, quadratic, and reasonable objectives given in (.).
11 Parabolic Objectives First we consider the maximization problem f = arg max { Γ χ p (f) : f R N}, (3.5a) where Γ χ p (f) is the family of parabolic objectives parametrized by χ 0 and given by Γ χ p (f) = µ rf + m T f 2 ft Vf χ f T Vf. (3.5b) If f 0 then the gradient of Γ χ p (f) is where σ = f T Vf > 0. f Γ χ p (f) = m Vf χ σ Vf,
12 Parabolic Objectives By setting this gradient equal to zero we see that if the maximizer f is nonzero then it satisfies where σ = f T Vf > 0. 0 = m σ + χ σ Vf, Upon solving this equation for f we obtain f = All that remains is to determine σ. σ σ + χ V m. (3.6)
13 Parabolic Objectives Because σ = f T Vf we have σ 2 = f T Vf = we conclude that σ satisfies σ 2 (σ + χ) 2 mt V m = (σ + χ) 2 = ν 2 tg. Because σ > 0 and χ 0 we see that and that σ is determined by σ 2 (σ + χ) 2 ν 2 tg, 0 χ < ν tg, (3.7) σ + χ = ν tg.
14 Parabolic Objectives Then the maximizer f given by (3.6) becomes f = ( χ ) V m. (3.8) ν tg Remark. Kelly investors take χ = 0, in which case (3.8) reduces to f = V m. (3.9) Formula (3.9) is often called fortune s formula in the belief that it is a good approximation to the Kelly strategy. In this view formula (3.8) gives an explicit fractional Kelly strategy for every χ (0, ν tg ). However, we will see that formula (3.9) gives an allocation that can be far from the Kelly strategy, and generally leads to overbetting.
15 Parabolic Objectives The foregoing analysis did not yield a maximzier when χ ν tg. To treat that case we will use the Cauchy inequality in the form m T f m T V m f T Vf. (3.0) When χ ν tg the positive definiteness of V, the fact χ ν tg, the Sharpe ratio formula (2.3b), and the above Cauchy inequality imply Therefore f = 0 when χ ν tg. Γ χ p (f) = µ rf + m T f 2 ft Vf χ f T Vf µ rf + m T f χ f T Vf µ rf + m T f ν tg f T Vf = µ rf + m T f m T V m f T Vf µ rf = Γp χ (0).
16 Parabolic Objectives Therefore the solution f of the maximization problem (3.5) is ( χ ) V m if χ < ν f = ν tg, tg 0 if χ ν tg. (3.) This solution lies on the efficient frontier (2.3a). It allocates f χ tg times the portfolio value in the tangent portfolio f tg given by (2.4) and f χ tg times the portfolio value in a risk-free asset, where ( f χ tg = χ ) µmv µ rf ν tg σmv 2. (3.2)
17 Quadratic Objectives Next we consider the maximization problem f = arg max { Γ χ q (f) : f R N}, (4.3a) where Γ χ q (f) is the family of quadratic objectives parametrized by χ 0 and given by Γq χ (f) = µ rf + m T f ( 2 µrf + m T f ) 2 2 ft Vf χ f T Vf. (4.3b) If f 0 then the gradient of Γ χ q (f) is where σ = f T Vf > 0. f Γ χ q (f) = ( µ rf ) m m m T f Vf χ σ Vf,
18 Quadratic Objectives By setting this gradient equal to zero we see that if the maximizer f is nonzero then it satisfies where σ = 0 = ( µ rf ) m m m T f σ + χ Vf, σ f T Vf > 0. After multiplying this relation by V and bringing the terms involving f to the left-hand side, we obtain σ + χ σ f + V m m T f = ( µ rf ) V m. (4.4)
19 Quadratic Objectives Now multiply this by σ m T and use the Sharpe ratio formula (2.3b), m T V m = ν 2 tg, to obtain which implies that ( σ + χ + ν 2 tg σ ) m T f = ( µ rf ) ν 2 tg σ, m T f = ( µ rf ) ν 2 tg σ σ + χ + ν 2 tg σ. When this expression is placed into (4.4) we can solve for f to find f = ( µ rf ) All that remains is to determine σ. σ σ + χ + ν 2 tg σ V m. (4.5)
20 Quadratic Objectives Because σ = f T Vf we have σ 2 = f T Vf = we conclude that σ satisfies = ( µ rf ) 2 σ 2 ( ( + ν 2 tg ) σ + χ ) 2 mt V m ( µ rf ) 2 σ 2 ( ( + ν 2 tg ) σ + χ ) 2 ν tg 2, ( ( + ν 2 tg ) σ + χ ) 2 = ( µrf ) 2 ν 2 tg.
21 Quadratic Objectives Because σ > 0 and χ 0 we see that and that σ is determined by 0 χ < ( µ rf ) ν tg, (4.6) ( + ν 2 tg) σ + χ = ( µ rf ) ν tg. Then the maximizer f given by (4.5) becomes f = ( µ rf χ ) ν tg + νtg 2 V m. (4.7)
22 Quadratic Objectives Remark. Kelly investors take χ = 0, in which case (4.7) reduces to f = µ rf + νtg 2 V m. (4.8) Formula (4.8) differs significantly from formula (3.9) whenever the Sharpe ratio ν tg is not small. Sharpe ratios are often near and sometimes can be as large as 3. So which of these should be called fortune s formula? Certainly not formula (3.9)! To see why, set f = V m into the quadratic objective (4.3b) with χ = 0 to obtain Γq 0 ( V m ) = µ rf + 2 ν tg 2 ( 2 µrf + νtg) 2 2, which can be negative when ν tg is near. So formula (3.9) can overbet!
23 Quadratic Objectives The foregoing analysis did not yield a maximzier when χ ( µ rf ) ν tg. In that case the positive definiteness of V, the fact χ ( µ rf ) ν tg, the Sharpe ratio formula (2.3b), and the Cauchy inequality (3.0) imply Γq χ (f) = µ rf + m T f ( 2 µrf + m T f ) 2 2 ft Vf χ f T Vf µ rf + m T f ( 2 µ 2 rf + 2µ rf m T f ) χ f T Vf = µ rf 2 µ 2 rf + ( µ rf ) m T f χ f T Vf µ rf 2 µ rf 2 + ( µ rf ) m T f ( µ rf ) ν tg f T Vf ( = µ rf 2 µ rf 2 + ( µ rf ) m T f m T V m ) f T Vf µ rf 2 µ 2 rf = Γ χ q (0). Therefore f = 0 when χ ( µ rf ) ν tg.
24 Quadratic Objectives Therefore the solution f of the maximization problem (4.3) is ( µ f = rf χ ) V m ν tg + ν 2 if χ < ( µ rf ) ν tg, tg 0 if χ ( µ rf ) ν tg. (4.9) This solution lies on the efficient frontier (2.3a). It allocates f χ tg times the portfolio value in the tangent portfolio f tg given by (2.4) and f χ tg times the portfolio value in a risk-free asset, where ( f χ tg = µ rf χ ) ν tg + νtg 2 µ mv µ rf σ 2 mv. (4.20)
25 Reasonable Objectives Next we consider the maximization problem f = arg max { Γ χ r (f) : f R N, + µ rf + m T f > 0 }, (5.2a) where Γ χ r (f) is the family of reasonable objectives parametrized by χ 0 and given by Γ χ r (f) = log ( + µ rf + m T f ) 2 ft Vf χ f T Vf. (5.2b) Because Γ χ r (f) as f approaches the boundary of the domain being considered in (5.2a), the maximizer f must lie in the interior of the domain. If f 0 then the gradient of Γ χ r (f) is f Γ χ r (f) = + µ m Vf χ σ Vf, where µ = µ rf + m T f and σ = f T Vf > 0.
26 Reasonable Objectives By setting this gradient equal to zero we see that if the maximizer f is nonzero then it satisfies where µ = µ rf + m T f and σ = Because σ = f T Vf we have σ 2 = f T Vf = f = + µ σ σ + χ V m, (5.22) = f T Vf > 0. ( + µ ) 2 σ 2 (σ + χ) 2 mt V m ( + µ ) 2 σ 2 (σ + χ) 2 ν 2 tg.
27 Reasonable Objectives From this we conclude that µ and σ satisfy (σ + χ) 2 = Because σ > 0 and χ 0 we see that ν 2 tg ( + µ ) 2. and that we can determine σ in terms of µ from σ + χ = ν tg. + µ 0 χ < ν tg + µ, (5.23) Then the maximizer f given by (5.22) becomes ( f = χ ) V m, (5.24) + µ ν tg
28 Reasonable Objectives Because µ = µ rf + m T f, by the Sharpe ratio formula (2.3b) we have ( µ = µ rf + m T f = µ rf + χ ) m T V m + µ ν tg ( = µ rf + χ ) νtg 2. + µ ν tg This can be reduced to the quadratic equation ( ) ( ) νtg 2 + µrf νtg + χ =, + µ + µ ν tg = ( + µrf + µ 2 ν tg ν tg which has the unique positive root ) χ ( + µrf ν tg χ ) 2. (5.25)
29 Reasonable Objectives Then condition (5.23) is satisfied if and only if 0 < ν tg + µ χ = 2 ( + µrf ν tg ) ( + χ + + µrf + 4 ν tg ) 2 χ. This inequality holds if and only if 0 < + 4 ( + µrf ν tg ) 2 χ ( + µrf 4 ν tg ) 2 + χ = + µ rf χ. ν tg This holds if and only if χ satisfies the bounds 0 χ < ν tg + µ rf. (5.26)
30 Reasonable Objectives By using (5.25) to eliminate µ from the maximizer f given by (5.24) we find f = ( ) ( ) + µrf 2 + χ + + µrf + χ V m. 2 4 ν tg This becomes f = ν tg ( χ ) + µ rf ν tg D ( ν tg χ, + µ rf ν tg ) V m, (5.27a) where D(χ, y) = 2 ( + χ y) + 2 ( χ y) 2 + 4y 2. (5.27b)
31 Reasonable Objectives Remark. Kelly investors take χ = 0, in which case (5.27) reduces to f = 2 ( + µ rf ) + V m. (5.28) 2 ( + µ rf ) 2 + 4νtg 2 This candidate for fortune s formula will be compared with the others later.
32 Reasonable Objectives The foregoing analysis did not yield a maximzier when ( + µ rf ) χ ν tg. The definiteness of V, the concavity of log(x), the fact ( + µ rf ) χ ν tg, the Sharpe ratio formula (2.3b), and Cauchy inequality (3.0) imply Γ χ r (f) = log ( + µ rf + m T f ) 2 ft Vf χ f T Vf log( + µ rf ) + mt f + µ rf χ f T Vf log( + µ rf ) + mt f ν tg + µ rf ( = log( + µ rf ) + m T f + µ rf log( + µ rf ) = Γr χ (0). Therefore f = 0 when ( + µ rf ) χ ν tg. + µ rf f T Vf m T V m f T Vf )
33 Reasonable Objectives Therefore the solution f of the maximization problem (5.2) is ( χ ) V m ( ) if χ < ν tg, + µ rf ν tg ν tg + µ rf f = D χ, + µ rf 0 if χ ν tg, + µ rf where D(χ, y) was defined by (5.27b). (5.29) This solution lies on the efficient frontier (2.3a). It allocates f χ tg times the portfolio value in the tangent portfolio f tg given by (2.4) and f χ tg times the portfolio value in a risk-free asset, where ( f χ tg = χ ) ( ) µ mv µ rf + µ rf ν tg ν tg σ 2. (5.30) mv D χ, + µ rf
34 Comparisons The maximizers for the parabolic, quadratic, and reasonable objectives are given by (3.), (4.9), and (5.29) respectively. They are ( f p χ ) V m if χ < ν = ν tg, tg (6.3a) 0 if χ ν tg, ( f q µ = rf χ ) V m ν tg + ν 2 if χ < ( µ rf ) ν tg, tg (6.3b) 0 if χ ( µ rf ) ν tg, ( χ ) V m ( ) if χ < ν tg, + µ rf ν tg ν tg + µ rf f r = D χ, + µ (6.3c) rf 0 if χ ν tg. + µ rf
35 Comparisons Fact. If µ rf [0, ) then f q is the most conservative of these allocations and f p is the most agressive. Proof. First observe that because µ rf [0, ) we have These inequalities imply that and that µ rf + µ rf. ( µ rf ) ν tg ν tg + µ rf ν tg, (6.32) µ rf χ ν tg Each of these inequalities is strict when µ rf (0, ). χ χ. (6.33) + µ rf ν tg ν tg
36 Comparisons Recall from (5.27b) that D(χ, y) = 2 ( + χ y) + 2 ( χ y) 2 + 4y 2. (6.34) For every y > 0 we have ) χ D(χ, y) = 2 ( y χ y > 0, ( χ y) 2 + 4y 2 whereby D(χ, y) is an strictly increasing function of χ. Hence, for every χ [0, y) we have < D(0, y) D(χ, y) < D(y, y) = + y 2. (6.35) Therefore when µ rf 0 we have ( ) ν tg νtg 2 < D χ, < + + µ rf ( + µ rf ) 2 + ν tg 2 if χ < ν tg. (6.36) + µ rf
37 Comparisons The inequalities (6.32) imply that f q given by (6.3b) has the smallest critical value of χ at which it becomes 0, and that f p given by (6.3a) has the largest critical value of χ at which it becomes 0. The inequalities (6.33) and (6.36) imply that the factor multiplying V m in the expression for f q given by (6.3b) is smaller than the factor multiplying V m in the expression for f r given by (6.3c), which is smaller than the factor multiplying V m in the expression for f p given by (6.3a). Hence, f q is more conservative than f, r which is more conservative than f p. Remark. The risk-free return µ rf is usually much smaller than the Sharpe ratio ν tg. This means that the main differences between the maximizers given by formulas (6.3) arise due to their dependence upon ν tg.
38 Comparisons In practice µ rf is often small enough that it can be neglected except in m. By setting µ rf = 0 in (6.3) we get ( f p χ ) V m if χ < ν = ν tg, tg (6.37a) 0 if χ ν tg, ( f q χ ) V m = ν tg + ν 2 if χ < ν tg, tg (6.37b) 0 if χ ν tg, ( f r χ ) V m if χ < ν = ν tg D(χ, ν tg ) tg, (6.37c) 0 if χ ν tg, where D(χ, y) is given by (6.34). These all are nonzero for χ < ν tg and all vanish for χ ν tg. We see from (6.35) that < D(χ, ν tg ) < + ν 2 tg.
39 Comparisons We now use formulas (6.37b) and (6.37c) to isolate the dependence of the maximizers f q and f r upon ν tg. Fact 2. For every χ [0, ν tg ) we have νtg 2 + νtg 2 D(χ, ν tg) + ν 2 tg <, (6.38) where the left-hand side is a strictly decreasing function of ν tg. Proof. By (6.35) we have + νtg 2 > D(χ, ν tg ) D(0, ν tg ) = νtg 2. The inequalities (6.38) follow. The task of proving the left-hand side of (6.38) is a strictly decreasing function of ν tg is left as an exercise.
40 Comparisons We now use Fact 2 to show that f q and f r are close when ν tg 2 3. Fact 3. If ν tg 2 3 then for every χ [0, ν tg) we have 2 3 D(χ, ν tg) + νtg 2 <. (6.39) Proof. By the monotonicity asserted in Fact 2 if ν tg 2 3 then νtg 2 + νtg = = 2 3. Then (6.39) follows from inequality (6.38) of Fact 2.
41 Comparisons Remark. A Kelly investor would set χ = 0, in which case (6.3) gives f p = V m, (6.40a) f q = µ rf + νtg 2 V m, f r = 2 ( + µ rf ) + V m. 2 ( + µ rf ) 2 + 4νtg 2 (6.40b) (6.40c) This is the case for which the difference between f q and f r is greatest. To get a feel for this difference, when µ rf = 0 and ν tg = 2 these become f q = 3 V m, f r = 2 V m, while when µ rf = 0 and ν tg = 6 these become f q = 7 V m, f r = 3 V m.
42 Seven Lessons Learned Here are some insights that we have gained.. The Sharpe ratio ν tg and the caution coefficient χ play a large role in determining the optimal allocation. In particular, when χ ν tg the optimal allocation is entirely in risk-free assets. 2. The risk-free return µ rf plays a role in determining the optimal allocation mainly through m. 3. For any choice of χ the maximizer for the quadratic objective is more conservative than the maximizer for the reasonable objective, which is more conservative than the maximizer for the parabolic objective. 4. The maximizer for a parabolic objective is agressive and will overbet when the Sharpe ratio ν tg is not small.
43 Seven Lessons Learned 5. The maximizers for quadratic and reasonable objectives are close when the Sharpe ratio ν tg is not large. As χ approaches ν tg, the maximizers for the quadratic and reasonable objectives will become closer. 6. We will have greater confidence in the computed Sharpe ratio ν tg when the tangency portfolio lies towards the nose of the efficient frontier. This translates into greater confidence in the maximizers for the quadratic and reasonable objectives. 7. Analyzing the maximizers for both the quadratic and reasonable objectives gave greater insights than analyzing each of them separately. Together they are fortune s formulas.
Portfolios that Contain Risky Assets 15: Central Limit Theorem Objectives
Portfolios that Contain Risky Assets 15: Central Limit Theorem Objectives C. David Levermore University of Maryland, College Park, MD Math 420: Mathematical Modeling April 21, 2018 version c 2018 Charles
More informationAggregate Risk. MFM Practitioner Module: Quantitative Risk Management. John Dodson. February 6, Aggregate Risk. John Dodson.
MFM Practitioner Module: Quantitative Risk Management February 6, 2019 As we discussed last semester, the general goal of risk measurement is to come up with a single metric that can be used to make financial
More informationGlobal Maxwellians over All Space and Their Relation to Conserved Quantites of Classical Kinetic Equations
Global Maxwellians over All Space and Their Relation to Conserved Quantites of Classical Kinetic Equations C. David Levermore Department of Mathematics and Institute for Physical Science and Technology
More informationModule 7 : Applications of Integration - I. Lecture 20 : Definition of the power function and logarithmic function with positive base [Section 20.
Module 7 : Applications of Integration - I Lecture 20 : Definition of the power function and logarithmic function with positive base [Section 201] Objectives In this section you will learn the following
More informationMFM Practitioner Module: Risk & Asset Allocation. John Dodson. January 25, 2012
MFM Practitioner Module: Risk & Asset Allocation January 25, 2012 Optimizing Allocations Once we have 1. chosen the markets and an investment horizon 2. modeled the markets 3. agreed on an objective with
More informationFitting Linear Statistical Models to Data by Least Squares: Introduction
Fitting Linear Statistical Models to Data by Least Squares: Introduction Radu Balan, Brian R. Hunt and C. David Levermore University of Maryland, College Park University of Maryland, College Park, MD Math
More informationFitting Linear Statistical Models to Data by Least Squares I: Introduction
Fitting Linear Statistical Models to Data by Least Squares I: Introduction Brian R. Hunt and C. David Levermore University of Maryland, College Park Math 420: Mathematical Modeling February 5, 2014 version
More informationReview of Optimization Methods
Review of Optimization Methods Prof. Manuela Pedio 20550 Quantitative Methods for Finance August 2018 Outline of the Course Lectures 1 and 2 (3 hours, in class): Linear and non-linear functions on Limits,
More informationWe saw in the previous lectures that continuity and differentiability help to understand some aspects of a
Module 3 : Differentiation and Mean Value Theorems Lecture 9 : Roll's theorem and Mean Value Theorem Objectives In this section you will learn the following : Roll's theorem Mean Value Theorem Applications
More informationHigher order moments of the estimated tangency portfolio weights
WORKING PAPER 0/07 Higher order moments of the estimated tangency portfolio weights Farrukh Javed, Stepan Mazur, Edward Ngailo Statistics ISSN 403-0586 http://www.oru.se/institutioner/handelshogskolan-vid-orebro-universitet/forskning/publikationer/working-papers/
More informationMFM Practitioner Module: Risk & Asset Allocation. John Dodson. February 18, 2015
MFM Practitioner Module: Risk & Asset Allocation February 18, 2015 No introduction to portfolio optimization would be complete without acknowledging the significant contribution of the Markowitz mean-variance
More informationRobust Efficient Frontier Analysis with a Separable Uncertainty Model
Robust Efficient Frontier Analysis with a Separable Uncertainty Model Seung-Jean Kim Stephen Boyd October 2007 Abstract Mean-variance (MV) analysis is often sensitive to model mis-specification or uncertainty,
More informationA Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance
A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance Seung Jean Kim Stephen Boyd Alessandro Magnani MIT ORC Sear 12/8/05 Outline A imax theorem Robust Fisher discriant
More informationOptimal Investment Strategies: A Constrained Optimization Approach
Optimal Investment Strategies: A Constrained Optimization Approach Janet L Waldrop Mississippi State University jlc3@ramsstateedu Faculty Advisor: Michael Pearson Pearson@mathmsstateedu Contents Introduction
More information39.1 Absolute maxima/minima
Module 13 : Maxima, Minima Saddle Points, Constrained maxima minima Lecture 39 : Absolute maxima / minima [Section 39.1] Objectives In this section you will learn the following : The notion of absolute
More informationMarkowitz Efficient Portfolio Frontier as Least-Norm Analytic Solution to Underdetermined Equations
Markowitz Efficient Portfolio Frontier as Least-Norm Analytic Solution to Underdetermined Equations Sahand Rabbani Introduction Modern portfolio theory deals in part with the efficient allocation of investments
More informationFitting Linear Statistical Models to Data by Least Squares I: Introduction
Fitting Linear Statistical Models to Data by Least Squares I: Introduction Brian R. Hunt and C. David Levermore University of Maryland, College Park Math 420: Mathematical Modeling January 25, 2012 version
More informationEquations in Quadratic Form
Equations in Quadratic Form MATH 101 College Algebra J. Robert Buchanan Department of Mathematics Summer 2012 Objectives In this lesson we will learn to: make substitutions that allow equations to be written
More informationTangent spaces, normals and extrema
Chapter 3 Tangent spaces, normals and extrema If S is a surface in 3-space, with a point a S where S looks smooth, i.e., without any fold or cusp or self-crossing, we can intuitively define the tangent
More informationBayesian Optimization
Practitioner Course: Portfolio October 15, 2008 No introduction to portfolio optimization would be complete without acknowledging the significant contribution of the Markowitz mean-variance efficient frontier
More informationSemidefinite Programming
Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has
More informationSupplementary File: Proof of Proposition 1
Supplementary File: Proof of Proposition 1 Tong Tong Wu and Kenneth Lange The expected loss E ( Y f(x) ɛ ) can be written as [ ] E [E ( Y f(x) ɛ X)] = E p (X) v f(x) ɛ X, where p (x) = Pr(Y = v X = x).
More information4 3A : Increasing and Decreasing Functions and the First Derivative. Increasing and Decreasing. then
4 3A : Increasing and Decreasing Functions and the First Derivative Increasing and Decreasing! If the following conditions both occur! 1. f (x) is a continuous function on the closed interval [ a,b] and
More informationLAGRANGE MULTIPLIERS
LAGRANGE MULTIPLIERS MATH 195, SECTION 59 (VIPUL NAIK) Corresponding material in the book: Section 14.8 What students should definitely get: The Lagrange multiplier condition (one constraint, two constraints
More informationHIGHER-ORDER LINEAR ORDINARY DIFFERENTIAL EQUATIONS. David Levermore Department of Mathematics University of Maryland.
HIGHER-ORDER LINEAR ORDINARY DIFFERENTIAL EQUATIONS David Levermore Department of Mathematics University of Maryland 28 March 2008 The following is a review of some of the material that we covered on higher-order
More informationFINANCIAL OPTIMIZATION
FINANCIAL OPTIMIZATION Lecture 1: General Principles and Analytic Optimization Philip H. Dybvig Washington University Saint Louis, Missouri Copyright c Philip H. Dybvig 2008 Choose x R N to minimize f(x)
More informationECON4515 Finance theory 1 Diderik Lund, 5 May Perold: The CAPM
Perold: The CAPM Perold starts with a historical background, the development of portfolio theory and the CAPM. Points out that until 1950 there was no theory to describe the equilibrium determination of
More informationDifferentiation - Important Theorems
Differentiation - Important Theorems Philippe B Laval KSU Spring 2012 Philippe B Laval (KSU) Differentiation - Important Theorems Spring 2012 1 / 10 Introduction We study several important theorems related
More informationChapter 8: Taylor s theorem and L Hospital s rule
Chapter 8: Taylor s theorem and L Hospital s rule Theorem: [Inverse Mapping Theorem] Suppose that a < b and f : [a, b] R. Given that f (x) > 0 for all x (a, b) then f 1 is differentiable on (f(a), f(b))
More informationFitting Linear Statistical Models to Data by Least Squares II: Weighted
Fitting Linear Statistical Models to Data by Least Squares II: Weighted Brian R. Hunt and C. David Levermore University of Maryland, College Park Math 420: Mathematical Modeling April 21, 2014 version
More informationEconomics 201b Spring 2010 Solutions to Problem Set 1 John Zhu
Economics 201b Spring 2010 Solutions to Problem Set 1 John Zhu 1a The following is a Edgeworth box characterization of the Pareto optimal, and the individually rational Pareto optimal, along with some
More informationLesson 59 Rolle s Theorem and the Mean Value Theorem
Lesson 59 Rolle s Theorem and the Mean Value Theorem HL Math - Calculus After this lesson, you should be able to: Understand and use Rolle s Theorem Understand and use the Mean Value Theorem 1 Rolle s
More informationMath 164-1: Optimization Instructor: Alpár R. Mészáros
Math 164-1: Optimization Instructor: Alpár R. Mészáros First Midterm, April 20, 2016 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By writing
More informationMultivariate GARCH models.
Multivariate GARCH models. Financial market volatility moves together over time across assets and markets. Recognizing this commonality through a multivariate modeling framework leads to obvious gains
More informationLesson 27 Linear Programming; The Simplex Method
Lesson Linear Programming; The Simplex Method Math 0 April 9, 006 Setup A standard linear programming problem is to maximize the quantity c x + c x +... c n x n = c T x subject to constraints a x + a x
More informationYear 10 Mathematics - Student Portfolio Summary
Year 10 - Student Portfolio Summary WORK SAMPLE PORTFOLIOS These work sample portfolios have been designed to illustrate satisfactory achievement in the relevant aspects of the achievement standard. The
More informationAsset Management with TEV and VaR Constraints: the Constrained Efficient Frontiers
Università Politecnica delle Marche DIPARTIMENTO DI SCIENZE ECONOMICHE E SOCIALI Asset Management with TEV and VaR Constraints: the Constrained Efficient Frontiers Giulio Palomba Luca Riccetti QUADERNO
More informationI. Bayesian econometrics
I. Bayesian econometrics A. Introduction B. Bayesian inference in the univariate regression model C. Statistical decision theory Question: once we ve calculated the posterior distribution, what do we do
More informationFirst In-Class Exam Solutions Math 410, Professor David Levermore Monday, 1 October 2018
First In-Class Exam Solutions Math 40, Professor David Levermore Monday, October 208. [0] Let {b k } k N be a sequence in R and let A be a subset of R. Write the negations of the following assertions.
More informationL p Spaces and Convexity
L p Spaces and Convexity These notes largely follow the treatments in Royden, Real Analysis, and Rudin, Real & Complex Analysis. 1. Convex functions Let I R be an interval. For I open, we say a function
More informationConvex Optimization M2
Convex Optimization M2 Lecture 3 A. d Aspremont. Convex Optimization M2. 1/49 Duality A. d Aspremont. Convex Optimization M2. 2/49 DMs DM par email: dm.daspremont@gmail.com A. d Aspremont. Convex Optimization
More informationV. Graph Sketching and Max-Min Problems
V. Graph Sketching and Max-Min Problems The signs of the first and second derivatives of a function tell us something about the shape of its graph. In this chapter we learn how to find that information.
More informationFrom Boltzmann Equations to Gas Dynamics: From DiPerna-Lions to Leray
From Boltzmann Equations to Gas Dynamics: From DiPerna-Lions to Leray C. David Levermore Department of Mathematics and Institute for Physical Science and Technology University of Maryland, College Park
More informationSolving Quadratic Equations
Solving Quadratic Equations MATH 101 College Algebra J. Robert Buchanan Department of Mathematics Summer 2012 Objectives In this lesson we will learn to: solve quadratic equations by factoring, solve quadratic
More information1 Convexity, concavity and quasi-concavity. (SB )
UNIVERSITY OF MARYLAND ECON 600 Summer 2010 Lecture Two: Unconstrained Optimization 1 Convexity, concavity and quasi-concavity. (SB 21.1-21.3.) For any two points, x, y R n, we can trace out the line of
More information3.5: Issues in Curve Sketching
3.5: Issues in Curve Sketching Mathematics 3 Lecture 20 Dartmouth College February 17, 2010 Typeset by FoilTEX Example 1 Which of the following are the graphs of a function, its derivative and its second
More informationNotes on Recursive Utility. Consider the setting of consumption in infinite time under uncertainty as in
Notes on Recursive Utility Consider the setting of consumption in infinite time under uncertainty as in Section 1 (or Chapter 29, LeRoy & Werner, 2nd Ed.) Let u st be the continuation utility at s t. That
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationDRAFT. Edward Ngailo. Department of Mathematics, University of Dar es Salaam Department of Mathematics, Stockholm University
On functions of a Wishart matrix and a normal vector with applications Edward Ngailo Department of Mathematics, University of Dar es Salaam Department of Mathematics, Stockholm University Second Network
More informationA SECOND ORDER STOCHASTIC DOMINANCE PORTFOLIO EFFICIENCY MEASURE
K Y B E R N E I K A V O L U M E 4 4 ( 2 0 0 8 ), N U M B E R 2, P A G E S 2 4 3 2 5 8 A SECOND ORDER SOCHASIC DOMINANCE PORFOLIO EFFICIENCY MEASURE Miloš Kopa and Petr Chovanec In this paper, we introduce
More informationFundamentals in Optimal Investments. Lecture I
Fundamentals in Optimal Investments Lecture I + 1 Portfolio choice Portfolio allocations and their ordering Performance indices Fundamentals in optimal portfolio choice Expected utility theory and its
More informationCHAPTER 2. The Derivative
CHAPTER The Derivative Section.1 Tangent Lines and Rates of Change Suggested Time Allocation: 1 to 1 1 lectures Slides Available on the Instructor Companion Site for this Text: Figures.1.1,.1.,.1.7,.1.11
More informationMath-2A Lesson 13-3 (Analyzing Functions, Systems of Equations and Inequalities) Which functions are symmetric about the y-axis?
Math-A Lesson 13-3 (Analyzing Functions, Systems of Equations and Inequalities) Which functions are symmetric about the y-axis? f ( x) x x x x x x 3 3 ( x) x We call functions that are symmetric about
More informationCS-E4830 Kernel Methods in Machine Learning
CS-E4830 Kernel Methods in Machine Learning Lecture 3: Convex optimization and duality Juho Rousu 27. September, 2017 Juho Rousu 27. September, 2017 1 / 45 Convex optimization Convex optimisation This
More informationMarket Risk. MFM Practitioner Module: Quantitiative Risk Management. John Dodson. February 8, Market Risk. John Dodson.
MFM Practitioner Module: Quantitiative Risk Management February 8, 2017 This week s material ties together our discussion going back to the beginning of the fall term about risk measures based on the (single-period)
More informationThe Steepest Descent Algorithm for Unconstrained Optimization
The Steepest Descent Algorithm for Unconstrained Optimization Robert M. Freund February, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 1 Steepest Descent Algorithm The problem
More informationPrecalculus. Barnett, Raymond A., Michael R. Ziegler, and Karl E. Byleen. Precalculus, 6th edition, McGraw- Hill, ISBN:
Precalculus Course Text Barnett, Raymond A., Michael R. Ziegler, and Karl E. Byleen. Precalculus, 6th edition, McGraw- Hill, 2008. ISBN: 978-0-07-331263-7. Course Description This course provides a working
More informationComputational Finance
Department of Mathematics at University of California, San Diego Computational Finance Optimization Techniques [Lecture 2] Michael Holst January 9, 2017 Contents 1 Optimization Techniques 3 1.1 Examples
More informationRobust Markowitz portfolio selection. ambiguous covariance matrix
under ambiguous covariance matrix University Paris Diderot, LPMA Sorbonne Paris Cité Based on joint work with A. Ismail, Natixis MFO March 2, 2017 Outline Introduction 1 Introduction 2 3 and Sharpe ratio
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics and Engineering Lecture notes for PDEs Sergei V. Shabanov Department of Mathematics, University of Florida, Gainesville, FL 32611 USA CHAPTER 1 The integration theory
More informationCS261: A Second Course in Algorithms Lecture #8: Linear Programming Duality (Part 1)
CS261: A Second Course in Algorithms Lecture #8: Linear Programming Duality (Part 1) Tim Roughgarden January 28, 2016 1 Warm-Up This lecture begins our discussion of linear programming duality, which is
More informationEC /11. Math for Microeconomics September Course, Part II Lecture Notes. Course Outline
LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC400 20010/11 Math for Microeconomics September Course, Part II Lecture Notes Course Outline Lecture 1: Tools for
More information14 March 2018 Module 1: Marginal analysis and single variable calculus John Riley. ( x, f ( x )) are the convex combinations of these two
4 March 28 Module : Marginal analysis single variable calculus John Riley 4. Concave conve functions A function f( ) is concave if, for any interval [, ], the graph of a function f( ) is above the line
More informationIntroduction to Computer Graphics (Lecture No 07) Ellipse and Other Curves
Introduction to Computer Graphics (Lecture No 07) Ellipse and Other Curves 7.1 Ellipse An ellipse is a curve that is the locus of all points in the plane the sum of whose distances r1 and r from two fixed
More informationAlg II Syllabus (First Semester)
Alg II Syllabus (First Semester) Unit 1: Solving linear equations and inequalities Lesson 01: Solving linear equations Lesson 02: Solving linear inequalities (See Calculator Appendix A and associated video.)
More informationLesson 3: Solving Equations A Balancing Act
Opening Exercise Let s look back at the puzzle in Lesson 1 with the t-shape and the 100-chart. Jennie came up with a sum of 380 and through the lesson we found that the expression to represent the sum
More informationAgenda today. Introduction to prescriptive modeling. Linear optimization models through three examples: Beyond linear optimization
Agenda today Introduction to prescriptive modeling Linear optimization models through three examples: 1 Production and inventory optimization 2 Distribution system design 3 Stochastic optimization Beyond
More informationKernel Methods. Machine Learning A W VO
Kernel Methods Machine Learning A 708.063 07W VO Outline 1. Dual representation 2. The kernel concept 3. Properties of kernels 4. Examples of kernel machines Kernel PCA Support vector regression (Relevance
More informationTHE RADIUS OF CONVERGENCE FORMULA. a n (z c) n, f(z) =
THE RADIUS OF CONVERGENCE FORMULA Every complex power series, f(z) = (z c) n, n=0 has a radius of convergence, nonnegative-real or infinite, R = R(f) [0, + ], that describes the convergence of the series,
More informationThe Liapunov Method for Determining Stability (DRAFT)
44 The Liapunov Method for Determining Stability (DRAFT) 44.1 The Liapunov Method, Naively Developed In the last chapter, we discussed describing trajectories of a 2 2 autonomous system x = F(x) as level
More informationCHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.
1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function
More informationMATH 8. Unit 1: Rational and Irrational Numbers (Term 1) Unit 2: Using Algebraic Properties to Simplify Expressions - Probability
MATH 8 Unit 1: Rational and Irrational Numbers (Term 1) 1. I CAN write an algebraic expression for a given phrase. 2. I CAN define a variable and write an equation given a relationship. 3. I CAN use order
More informationWORD: EXAMPLE(S): COUNTEREXAMPLE(S): EXAMPLE(S): COUNTEREXAMPLE(S): WORD: EXAMPLE(S): COUNTEREXAMPLE(S): EXAMPLE(S): COUNTEREXAMPLE(S): WORD:
Bivariate Data DEFINITION: In statistics, data sets using two variables. Scatter Plot DEFINITION: a bivariate graph with points plotted to show a possible relationship between the two sets of data. Positive
More informationModern Portfolio Theory with Homogeneous Risk Measures
Modern Portfolio Theory with Homogeneous Risk Measures Dirk Tasche Zentrum Mathematik Technische Universität München http://www.ma.tum.de/stat/ Rotterdam February 8, 2001 Abstract The Modern Portfolio
More informationMath 273a: Optimization Basic concepts
Math 273a: Optimization Basic concepts Instructor: Wotao Yin Department of Mathematics, UCLA Spring 2015 slides based on Chong-Zak, 4th Ed. Goals of this lecture The general form of optimization: minimize
More informationChapter 7. Extremal Problems. 7.1 Extrema and Local Extrema
Chapter 7 Extremal Problems No matter in theoretical context or in applications many problems can be formulated as problems of finding the maximum or minimum of a function. Whenever this is the case, advanced
More informationCOURSE: AP Calculus BC GRADE: 12 PA ACADEMIC STANDARDS FOR MATHEMATICS:
COURSE: AP Calculus BC GRADE: 12 UNIT 1: Functions and Graphs TIME FRAME: 7 Days PA ACADEMIC STANDARDS FOR MATHEMATICS: M11.A.1 M11.A.1.1 M11.A.1.1.1 M11.A.1.1.2 M11.A.1.1.3 M11.A.2 M11.A.2.1 M11.A.2.1.1
More informationECON4510 Finance Theory Lecture 2
ECON4510 Finance Theory Lecture 2 Diderik Lund Department of Economics University of Oslo 26 August 2013 Diderik Lund, Dept. of Economics, UiO ECON4510 Lecture 2 26 August 2013 1 / 31 Risk aversion and
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationBob Brown, CCBC Essex Math 163 College Algebra, Chapter 1 Section 7 COMPLETED 1 Linear, Compound, and Absolute Value Inequalities
Bob Brown, CCBC Essex Math 163 College Algebra, Chapter 1 Section 7 COMPLETED 1 What is the following symbol? < The inequality symbols < > are used to compare two real numbers. The meaning of anyone of
More informationStatistics: Learning models from data
DS-GA 1002 Lecture notes 5 October 19, 2015 Statistics: Learning models from data Learning models from data that are assumed to be generated probabilistically from a certain unknown distribution is a crucial
More informationSection 4.3 Concavity and Curve Sketching 1.5 Lectures. Dr. Abdulla Eid. College of Science. MATHS 101: Calculus I
Section 4.3 Concavity and Curve Sketching 1.5 Lectures College of Science MATHS 101: Calculus I (University of Bahrain) Concavity 1 / 29 Concavity Increasing Function has three cases (University of Bahrain)
More informationFibonacci-Like Sequences and Pell Equations
n local maxima for f (x corresponds to an inflection point for F(x that does not admit a Descartes line. Hence the polynomial F(x of degree n + has a Descartes number of n. Note that given the restrictions
More informationConstrained Optimization and Lagrangian Duality
CIS 520: Machine Learning Oct 02, 2017 Constrained Optimization and Lagrangian Duality Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may or may
More informationChoice under Uncertainty
In the Name of God Sharif University of Technology Graduate School of Management and Economics Microeconomics 2 44706 (1394-95 2 nd term) Group 2 Dr. S. Farshad Fatemi Chapter 6: Choice under Uncertainty
More informationORIGINS OF STOCHASTIC PROGRAMMING
ORIGINS OF STOCHASTIC PROGRAMMING Early 1950 s: in applications of Linear Programming unknown values of coefficients: demands, technological coefficients, yields, etc. QUOTATION Dantzig, Interfaces 20,1990
More informationMATH 1A, Complete Lecture Notes. Fedor Duzhin
MATH 1A, Complete Lecture Notes Fedor Duzhin 2007 Contents I Limit 6 1 Sets and Functions 7 1.1 Sets................................. 7 1.2 Functions.............................. 8 1.3 How to define a
More informationMultivariate Tests of the CAPM under Normality
Multivariate Tests of the CAPM under Normality Bernt Arne Ødegaard 6 June 018 Contents 1 Multivariate Tests of the CAPM 1 The Gibbons (198) paper, how to formulate the multivariate model 1 3 Multivariate
More informationThe Rocket Car. UBC Math 403 Lecture Notes by Philip D. Loewen
The Rocket Car UBC Math 403 Lecture Notes by Philip D. Loewen We consider this simple system with control constraints: ẋ 1 = x, ẋ = u, u [ 1, 1], Dynamics. Consider the system evolution on a time interval
More informationMath 212-Lecture Interior critical points of functions of two variables
Math 212-Lecture 24 13.10. Interior critical points of functions of two variables Previously, we have concluded that if f has derivatives, all interior local min or local max should be critical points.
More informationConvex optimization problems. Optimization problem in standard form
Convex optimization problems optimization problem in standard form convex optimization problems linear optimization quadratic optimization geometric programming quasiconvex optimization generalized inequality
More informationWorst Case Portfolio Optimization and HJB-Systems
Worst Case Portfolio Optimization and HJB-Systems Ralf Korn and Mogens Steffensen Abstract We formulate a portfolio optimization problem as a game where the investor chooses a portfolio and his opponent,
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationIMAGINARY NUMBERS COMMON CORE ALGEBRA II
Name: Date: IMAGINARY NUMBERS COMMON CORE ALGEBRA II Recall that in the Real Number System, it is not possible to take the square root of a negative quantity because whenever a real number is squared it
More informationCSCI : Optimization and Control of Networks. Review on Convex Optimization
CSCI7000-016: Optimization and Control of Networks Review on Convex Optimization 1 Convex set S R n is convex if x,y S, λ,µ 0, λ+µ = 1 λx+µy S geometrically: x,y S line segment through x,y S examples (one
More information18.03SC Practice Problems 2
8.03SC Practice Problems 2 Direction fields, integral curves, isoclines, separatrices, funnels Solution Suggestions As an example, take the ODE dy = x 2y.. Draw a big axis system and plot some isoclines,
More informationMATH 7 HONORS. Unit 1: Rational and Irrational Numbers (Term 1) Unit 2: Using Algebraic Properties to Simplify Expressions - Probability
MATH 7 HONORS Unit 1: Rational and Irrational Numbers (Term 1) 1. I CAN write an algebraic expression for a given phrase. 2. I CAN define a variable and write an equation given a relationship. 3. I CAN
More informationReview for the Final Exam
Math 171 Review for the Final Exam 1 Find the limits (4 points each) (a) lim 4x 2 3; x x (b) lim ( x 2 x x 1 )x ; (c) lim( 1 1 ); x 1 ln x x 1 sin (x 2) (d) lim x 2 x 2 4 Solutions (a) The limit lim 4x
More informationNFC ACADEMY COURSE OVERVIEW
NFC ACADEMY COURSE OVERVIEW Pre-calculus is a full-year, high school credit course that is intended for the student who has successfully mastered the core algebraic and conceptual geometric concepts covered
More informationGeneral approach to the optimal portfolio risk management
General approach to the optimal portfolio risk management Zinoviy Landsman, University of Haifa Joint talk with Udi Makov and Tomer Shushi This presentation has been prepared for the Actuaries Institute
More information