Search results for "TIMI"

showing 10 items of 4651 documents

Reduced Order Models for Pricing European and American Options under Stochastic Volatility and Jump-Diffusion Models

2017

Abstract European options can be priced by solving parabolic partial(-integro) differential equations under stochastic volatility and jump-diffusion models like the Heston, Merton, and Bates models. American option prices can be obtained by solving linear complementary problems (LCPs) with the same operators. A finite difference discretization leads to a so-called full order model (FOM). Reduced order models (ROMs) are derived employing proper orthogonal decomposition (POD). The early exercise constraint of American options is enforced by a penalty on subset of grid points. The presented numerical experiments demonstrate that pricing with ROMs can be orders of magnitude faster within a give…

ta113Mathematical optimizationGeneral Computer ScienceStochastic volatilityDifferential equationEuropean optionMonte Carlo methods for option pricingJump diffusion010103 numerical & computational mathematics01 natural sciencesTheoretical Computer Science010101 applied mathematicsValuation of optionsModeling and Simulationlinear complementary problemRange (statistics)Asian optionreduced order modelFinite difference methods for option pricing0101 mathematicsAmerican optionoption pricingMathematicsJournal of Computational Science
researchProduct

Interactive Multiple Criteria Decision Making based on preference driven Evolutionary Multiobjective Optimization with controllable accuracy

2012

Abstract We present an approach to interactive Multiple Criteria Decision Making based on preference driven Evolutionary Multiobjective Optimization with controllable accuracy. The approach relies on formulae for lower and upper bounds on coordinates of the outcome of an arbitrary efficient variant corresponding to preference information expressed by the Decision Maker. In contrast to earlier works on that subject, here lower and upper bounds can be calculated and their accuracy controlled entirely within evolutionary computation framework. This is made possible by exploration of not only the region of feasible variants – a standard within evolutionary optimization, but also the region of i…

ta113Mathematical optimizationInformation Systems and ManagementGeneral Computer ScienceComputationta111Contrast (statistics)Interactive evolutionary computationManagement Science and Operations ResearchMulti-objective optimizationOutcome (game theory)Industrial and Manufacturing EngineeringEvolutionary computationModeling and SimulationPreference (economics)Evolutionary programmingMathematicsEuropean Journal of Operational Research
researchProduct

Genetic programming through bi-objective genetic algorithms with a study of a simulated moving bed process involving multiple objectives

2013

A new bi-objective genetic programming (BioGP) technique has been developed for meta-modeling and applied in a chromatographic separation process using a simulated moving bed (SMB) process. The BioGP technique initially minimizes training error through a single objective optimization procedure and then a trade-off between complexity and accuracy is worked out through a genetic algorithm based bi-objective optimization strategy. A benefit of the BioGP approach is that an expert user or a decision maker (DM) can flexibly select the mathematical operations involved to construct a meta-model of desired complexity or accuracy. It is also designed to combat bloat - a perennial problem in genetic …

ta113Mathematical optimizationMeta-optimizationArtificial neural networkComputer scienceta111Evolutionary algorithmGenetic programmingOverfittingMulti-objective optimizationSimulation-based optimizationGenetic algorithmMetaheuristicSoftwareApplied Soft Computing
researchProduct

Ensemble strategies in Compact Differential Evolution

2011

Differential Evolution is a population based stochastic algorithm with less number of parameters to tune. However, the performance of DE is sensitive to the mutation and crossover strategies and their associated parameters. To obtain optimal performance, DE requires time consuming trial and error parameter tuning. To overcome the computationally expensive parameter tuning different adaptive/self-adaptive techniques have been proposed. Recently the idea of ensemble strategies in DE has been proposed and favorably compared with some of the state-of-the-art self-adaptive techniques. Compact Differential Evolution (cDE) is modified version of DE algorithm which can be effectively used to solve …

ta113Mathematical optimizationStochastic processComputer scienceDifferential evolutionCrossoverGlobal optimizationEvolutionary computation2011 IEEE Congress of Evolutionary Computation (CEC)
researchProduct

Reduced Order Models for Pricing American Options under Stochastic Volatility and Jump-diffusion Models

2016

American options can be priced by solving linear complementary problems (LCPs) with parabolic partial(-integro) differential operators under stochastic volatility and jump-diffusion models like Heston, Merton, and Bates models. These operators are discretized using finite difference methods leading to a so-called full order model (FOM). Here reduced order models (ROMs) are derived employing proper orthogonal decomposition (POD) and non negative matrix factorization (NNMF) in order to make pricing much faster within a given model parameter variation range. The numerical experiments demonstrate orders of magnitude faster pricing with ROMs. peerReviewed

ta113Mathematical optimizationStochastic volatilityDiscretizationComputer scienceJump diffusionFinite difference method010103 numerical & computational mathematics01 natural sciencesNon-negative matrix factorization010101 applied mathematicsValuation of optionslinear complementary problemRange (statistics)General Earth and Planetary SciencesApplied mathematicsreduced order modelFinite difference methods for option pricing0101 mathematicsAmerican optionoption pricingGeneral Environmental ScienceProcedia Computer Science
researchProduct

Iterative Methods for Pricing American Options under the Bates Model

2013

We consider the numerical pricing of American options under the Bates model which adds log-normally distributed jumps for the asset value to the Heston stochastic volatility model. A linear complementarity problem (LCP) is formulated where partial derivatives are discretized using finite differences and the integral resulting from the jumps is evaluated using simple quadrature. A rapidly converging fixed point iteration is described for the LCP, where each iterate requires the solution of an LCP. These are easily solved using a projected algebraic multigrid (PAMG) method. The numerical experiments demonstrate the efficiency of the proposed approach. Furthermore, they show that the PAMG meth…

ta113Mathematical optimizationStochastic volatilityDiscretizationIterative methodComputer scienceFinite difference methodLinear complementarity problemIterative methodQuadrature (mathematics)Multigrid methodFixed-point iterationBates modelLinear complementarity problemGeneral Earth and Planetary SciencesPartial derivativeAmerican optionGeneral Environmental ScienceProcedia Computer Science
researchProduct

Super-fit and population size reduction in compact Differential Evolution

2011

Although Differential Evolution is an efficient and versatile optimizer, it has a wide margin of improvement. During the latest years much effort of computer scientists studying Differential Evolution has been oriented towards the improvement of the algorithmic paradigm by adding and modifying components. In particular, two modifications lead to important improvements to the original algorithmic performance. The first is the super-fit mechanism, that is the injection at the beginning of the optimization process of a solution previously improved by another algorithm. The second is the progressive reduction of the population size during the evolution of the population. Recently, the algorithm…

ta113Mathematical optimizationeducation.field_of_studyMeta-optimizationFitness landscapeComputer sciencePopulation-based incremental learningPopulationContext (language use)Reduction (complexity)Differential evolutionAlgorithm designeducationAlgorithm2011 IEEE Workshop on Memetic Computing (MC)
researchProduct

Synchronous R-NSGA-II: An Extended Preference-Based Evolutionary Algorithm for Multi-Objective Optimization

2015

Classical evolutionary multi-objective optimization algorithms aim at finding an approx- imation of the entire set of Pareto optimal solutions. By considering the preferences of a decision maker within evolutionary multi-objective optimization algorithms, it is possible to focus the search only on those parts of the Pareto front that satisfy his/her preferences. In this paper, an extended preference-based evolutionary algorithm has been proposed for solving multi-objective optimiza- tion problems. Here, concepts from an interactive synchronous NIMBUS method are borrowed and combined with the R-NSGA-II algorithm. The proposed synchronous R-NSGA-II algorithm uses preference information provid…

ta113Mathematical optimizationinteractive multi-objective optimizationApplied MathematicsEvolutionary algorithmApproxDecision makerMulti-objective optimizationscalarizing functionSet (abstract data type)Pareto optimalevolutionary multi-objective optimizationpreference-based evolutionary algorithmsFocus (optics)Preference (economics)Information SystemsMathematicsInformatica
researchProduct

IMEX schemes for pricing options under jump–diffusion models

2014

We propose families of IMEX time discretization schemes for the partial integro-differential equation derived for the pricing of options under a jump-diffusion process. The schemes include the families of IMEX-midpoint, IMEX-CNAB and IMEX-BDF2 schemes. Each family is defined by a convex combination parameter [email protected]?[0,1], which divides the zeroth-order term due to the jumps between the implicit and explicit parts in the time discretization. These IMEX schemes lead to tridiagonal systems, which can be solved extremely efficiently. The schemes are studied through Fourier stability analysis and numerical experiments. It is found that, under suitable assumptions and time step restric…

ta113Numerical AnalysisMathematical optimizationTridiagonal matrixDiscretizationApplied MathematicsJump diffusionStability (probability)Term (time)Computational MathematicsValuation of optionsConvex combinationLinear multistep methodMathematicsApplied Numerical Mathematics
researchProduct

LOCAL CONTROL OF SOUND IN STOCHASTIC DOMAINS BASED ON FINITE ELEMENT MODELS

2011

A numerical method for optimizing the local control of sound in a stochastic domain is developed. A three-dimensional enclosed acoustic space, for example, a cabin with acoustic actuators in given locations is modeled using the finite element method in the frequency domain. The optimal local noise control signals minimizing the least square of the pressure field in the silent region are given by the solution of a quadratic optimization problem. The developed method computes a robust local noise control in the presence of randomly varying parameters such as variations in the acoustic space. Numerical examples consider the noise experienced by a vehicle driver with a varying posture. In a mod…

ta113Stochastic domainAcoustics and UltrasonicsComputer scienceApplied MathematicsAcousticsNoise reductionNumerical analysisstokastinen aluekvadraattinen optimointipassenger carFinite element methodhenkilöautoelementtimenetelmäAcoustic spacequadratic optimizationNoiseFrequency domainNoise controlHelmholtz equationQuadratic programmingpaikallinen äänenhallintaäärellisten elementtien menetelmäHelmholtzin yhtälölocal sound controlJournal of Computational Acoustics
researchProduct