ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Mathematical finance 10 (2000), S. 0 
    ISSN: 1467-9965
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Mathematics , Economics
    Notes: This paper is a compendium of results—theoretical and computational—from a series of recent papers developing a new American option valuation technique based on linear programming (LP). Some further computational results are included for completeness. A proof of the basic analytical theorem is given, as is the analysis needed to solve the inverse problem of determining local (one-factor) volatility from market data. The ideas behind a fast accurate revised simplex method, whose performance is linear in time and space discretizations, are described and the practicalities of fitting the volatility smile are discussed. Numerical results are presented which show the LP valuation technique to be extremely fast—lattice speed with PDE accuracy. American options valued in the paper range from vanilla, through exotic with constant volatility, to exotic options fitting the volatility smile.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Oxford, UK and Boston, USA : Blackwell Publishers Inc
    Mathematical finance 9 (1999), S. 0 
    ISSN: 1467-9965
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Mathematics , Economics
    Notes: We investigate numerical solution of finite difference approximations to American option pricing problems, using a new direct numerical method: simplex solution of a linear programming formulation. This approach is based on an extension to the parabolic case of the equivalence between linear order complementarity problems and abstract linear programs known for certain elliptic operators. We test this method empirically, comparing simplex and interior point algorithms with the projected successive overrelaxation (PSOR) algorithm applied to the American vanilla and lookback puts. We conclude that simplex is roughly comparable with projected SOR on average (faster for fine discretizations, slower for coarse), but is more desirable for robustness of solution time under changes in parameters. Furthermore, significant speedups over the results given here have been achieved and will be published elsewhere.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    [s.l.] : Nature Publishing Group
    Nature 350 (1991), S. 197-197 
    ISSN: 1476-4687
    Source: Nature Archives 1869 - 2009
    Topics: Biology , Chemistry and Pharmacology , Medicine , Natural Sciences in General , Physics
    Notes: [Auszug] HASTIE ETAL. REPLY - We hypothesized that telomere loss may play a part in generating the genetic instability observed in a particular cancer, colorectal carcinoma1. Jankovic et al. attribute to us more far-reach-ing conclusions than we made from our study. Of course, if telomere length were the ...
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Public choice 1 (1966), S. 63-132 
    ISSN: 1573-7101
    Source: Springer Online Journal Archives 1860-2000
    Topics: Economics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Applied mathematics & optimization 33 (1996), S. 211-225 
    ISSN: 1432-0606
    Keywords: Clarke generalized gradient ; Bellman-Hamilton-Jacobi equation ; Necessary and sufficient optimality conditions ; Primary 49L05 ; Secondary 49L20
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we study conditions for optimality of a deterministic control problem where the state of the system is required to stop at the boundary. Using the Clarke generalized gradient, we refine the classical verification theorem and show that it is not only sufficient but also necessary for optimality. It is also shown that the solution to the generalized Bellman-Jacobi-Hamilton equation involving the Clarke generalized gradient is unique among the class of regular functions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 78 (1993), S. 109-125 
    ISSN: 1573-2878
    Keywords: Numerical algorithms ; convergence rates ; comparison sequences
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We analyze the behavior of common indices used in numerical linear algebra, analysis, and optimization to measure rates of convergence of an algorithm. A simple consistent axiomatic structure is used to uniquely define convergence rate measures on the basic linear, superlinear, and sublinear scales in terms of standard comparison sequences. Agreement with previously utilized indices and related measures is discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 81 (1998), S. 163-188 
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Dynamic multistage stochastic linear programming has many practical applications forproblems whose current decisions have to be made under future uncertainty. There are avariety of methods for solving these problems including nested Benders decomposition. Inthis method, recently shown to be superior to the alternatives for large problems, the problemis decomposed into a set of smaller linear programming problems. These problems can bevisualised as being attached to the nodes of a tree which is formed from the realizations ofthe random data vectors determining the uncertainty in the problem. The tree is traversedforwards and backwards, with information from the solutions to each nodal linear programmingproblem being passed to its immediate descendants by the formation of their righthand sides and to its immediate ancestor in the form of cuts. Problems in the same timeperiod can be solved independently and it is this inherent parallelism that is exploited inour parallel nested Benders algorithm. A parallel version of the MSLiP nested Benders codehas been developed and tested on various types of MIMD machines. The differing structuresof the test problems cause differing levels of speed-up. Results show that problems withfew variables and constraints per node do not gain from this parallelization. Stage aggregationhas been successfully exploited for such problems to improve their parallel solutionefficiency by increasing the size of the nodes and therefore the time spent calculating relativeto the time spent communicating between processors.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 81 (1998), S. 131-162 
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Multistage stochastic programming - in contrast to stochastic control - has found wideapplication in the formulation and solution of financial problems characterized by a largenumber of state variables and a generally low number of possible decision stages. Theliterature on the use of multistage recourse modelling to formalize complex portfolio optimizationproblems dates back to the early seventies, when the technique was first adopted tosolve a fixed income security portfolio problem. We present here the CALM model, whichhas been designed to deal with uncertainty affecting both assets (in either the portfolio orthe market) and liabilities (in the form of scenario dependent payments or borrowing costs).We consider as an instance a pension fund problem in which portfolio rebalancing is allowedover a long-term horizon at discrete time points and where liabilities refer to five differentclasses of pension contracts. The portfolio manager, given an initial wealth, seeks the maximizationof terminal wealth at the horizon, with investment returns modelled as discretestate random vectors. Decision vectors represent possible investments in the market andholding or selling assets in the portfolio, as well as borrowing decisions from a credit lineor deposits with a bank. Computational results are presented for a set of 10-stage portfolioproblems using different solution methods and libraries (OSL, CPLEX, OB1). The portfolioproblem, with an underlying vector data process which allows up to 2688 realizations at the10-year horizon, is solved on an IBM RS6000y590 for a set of twenty-four large-scale testproblems using the simplex and barrier methods provided by CPLEX (the latter for eitherlinear or quadratic objective), the predictorycorrector interior point method provided in OB1,the simplex method of OSL, the MSLiP-OSL code instantiating nested Benders decompositionwith subproblem solution using OSL simplex, and the current version of MSLiP.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Publication Date: 1996-05-01
    Print ISSN: 0095-4616
    Electronic ISSN: 1432-0606
    Topics: Mathematics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Publication Date: 1993-07-01
    Print ISSN: 0022-3239
    Electronic ISSN: 1573-2878
    Topics: Mathematics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...