Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

2685378051,073 · Jun 202019922001200920172026
48 results for partial differential complementarity problems

Study efficient numerical methods for American basket options.

problem Valuation of American basket options.
method Partial differential complementarity problems (PDCPs) and efficient discretization.
result Approximations of American basket options are close and converge favourably.

In this paper a simple, effective adaptation of Alternating Direction Implicit (ADI) time discretization schemes is proposed for the numerical pricing of American-style options under the Heston model via a partial differential complementarity problem. The stability and convergence of the new methods are extensively inv…

2013-08-31abs ↗pdf ↗

This paper deals with the numerical approximation of American-style option values governed by partial differential complementarity problems. For a variety of one- and two-asset American options we investigate by ample numerical experiments the temporal convergence behaviour of three modern splitting methods: the explic…

2016-10-30abs ↗pdf ↗

ANNs solve financial option valuation problems without numerical methods.

problem Valuation of European and American financial options.
method Unsupervised learning with artificial neural networks (ANNs) for solving PDEs.
result ANNs accurately compute option values for various stock scenarios.

Geometric programming approach for traffic equilibrium problems.

problem Optimizing traffic equilibrium in transportation systems.
method Finslerian dynamical model for nonlinear complementarity problems.
result Effective solution for various equilibrium problems in transportation.

The study examines pricing American options with both exogenous and endogenous transaction costs.

problem Pricing American options with transaction costs and liquidity risks.
method Modeling liquidity risks as a mean-reverting process and transaction costs as proportional to trading amount. Two nonlinear PDEs are used to characterize option values. Numerical solution via ADI method and model calibration using maximum likelihood estimation.
result The model incorporating liquidity risks significantly outperforms the Leland model.

Financial derivatives pricing aims to find the fair value of a financial contract on an underlying asset. Here we consider option pricing in the partial differential equations framework. The contemporary models lead to one-dimensional or multidimensional parabolic problems of the convection-diffusion type and generaliz…

2015-04-04abs ↗pdf ↗

Paper proves existence and uniqueness of solutions to PIDEs in Bessel spaces for option pricing.

problem Existence and uniqueness of solutions to PIDEs in Bessel spaces.
method Abstract semilinear parabolic equations and Bessel potential spaces.
result Proves existence and uniqueness of solutions in Bessel potential spaces.

Improved Frank-Wolfe algorithm for polytopes converges linearly with dimension dependence on optimal face.

problem Efficiently solving convex minimization problems over polytopes with linear rate.
method Revisiting Frank-Wolfe algorithm with strict complementarity assumption and away-steps.
result Linear convergence rate independent of polytope dimension for optimal face.

Some of recent developments, including recent results, ideas, techniques, and approaches, in the study of degenerate partial differential equations are surveyed and analyzed. Several examples of nonlinear degenerate, even mixed, partial differential equations, are presented, which arise naturally in some longstanding, …

2010-05-15abs ↗pdf ↗

Studies projective geometry and partial differential equations prolongation.

problem Understanding the prolongation of overdetermined geometric partial differential equations.
method Introduction to differential geometry and tractor calculus, study of prolongation of equations.
result Recovery of projective tractor and cotractor connections via partial differential equations prolongation.

Study explores optimal strategies in games with multiple players and mean-field interactions.

problem Optimal strategies in games with multiple players and mean-field interactions.
method Exploration of three different notions of optimality, including mean-field control solution, mean-field coarse correlated equilibria, and mean-field Nash equilibria.
result Approximation of cooperative and competitive equilibria in large NN-player games by mean-field control and mean-field equilibria.

New tensor recovery method improves efficiency under strict complementarity.

problem Efficiently recovering low-rank tensors using tensor nuclear norm.
method Developed strict complementarity condition for tensor nuclear norm ball and applied to gradient methods.
result Standard gradient methods achieve linear convergence and nearly linear runtime under strict complementarity.

In a previous paper the second author showed that if MM is a pseudomanifold with complementarity other than the 6-vertex real projective plane and the 9-vertex complex projective plane, then MM must have dimension 6\geq 6, and - in case of equality - MM must have exactly 12 vertices. In this paper we prove that suc…

2004-04-12abs ↗pdf ↗

An optimal control problem associated with the dynamics of the orientation of a bipolar molecule in the plane can be understood by means of tools in differential geometry. For first time in the literature kk-symplectic formalism is used to provide the optimal control problems associated to some families of partial dif…

2012-10-25abs ↗pdf ↗

In this work we present a review of the state of the art of information theoretic feature selection methods. The concepts of feature relevance, redundance and complementarity (synergy) are clearly defined, as well as Markov blanket. The problem of optimal feature selection is defined. A unifying theoretical framework i…

2015-09-24abs ↗pdf ↗

Differentiable relaxation for inferring partial orders from noisy linear data.

problem Inference of partial orders from linear data with noisy observations.
method Introducing a differentiable relaxation to model noisy linear extensions, replacing discontinuous precedence and feasibility with smooth surrogates.
result Smooth posterior that preserves partial-order semantics, supports gradient-based inference, and converges to hard likelihood.

We study the pricing problem for corporate defaultable bond from the viewpoint of the investors outside the firm that could not exactly know about the information of the firm. We consider the problem for pricing of corporate defaultable bond in the case when the firm value is only declared in some fixed discrete time a…

2013-02-15abs ↗pdf ↗

The paper examines the neural tangent kernel for PINNs solving general PDEs and finds convergence conditions.

problem Analyzing the convergence of neural tangent kernel for PINNs solving general PDEs.
method Analysis of NTK initialization and convergence during training for general PDEs using PINNs.
result Homogeneity of differential operators is crucial for NTK convergence.

We start discussing basic properties of Lie groupoids and Lie pseudo-groups in view of applying these techniques to the analysis of Jordan-Hölder resolutions and the subsequent integration of partial differential equations which is the summit of Lie and Cartan's work. Next, we discuss the integration problem for system…

2015-11-27abs ↗pdf ↗

An differential field (F;1,...,m)(F;\partial_1,...,\partial_m) of characteristic zero, a subgroup HH of affine group GL(n,C)Cn GL(n,C)\propto C^n with respect to its identical representation in FnF^n and the following two fields of differential rational functions in x=(x1,x2,...,xn)x=(x_1,x_2,...,x_n)-column vector, $$C< x, \partial >^H=\{f^{\part…

2006-09-09abs ↗pdf ↗

Study methods to recover unknown processes in PDEs from data.

problem Identifying unknown processes in time-dependent PDEs using observational data.
method Theoretical analysis and numerical approaches including Galerkin and collocation algorithms.
result The Galerkin algorithm is more suitable for practical situations with noisy data.

We develop the Lorentzian geometry of a crooked halfspace in 2+1-dimensional Minkowski space. We calculate the affine, conformal and isometric automorphism groups of a crooked halfspace, and discuss its stratification into orbit types, giving an explicit slice for the action of the automorphism group. The set of parall…

2012-11-18abs ↗pdf ↗

We study time-like surfaces in the three-dimensional Minkowski space with diagonalizable second fundamental form. On any time-like W-surface we introduce locally natural principal parameters and prove that such a surface is determined uniquely (up to motion) by a special invariant function, which satisfies a natural no…

2011-05-18abs ↗pdf ↗

This paper solves optimal investment-consumption problems for a risk-averse agent with special utility.

problem Optimal investment-consumption problem for a risk-averse agent with special utility.
method Introduced proper utility process and solved optimal investment-consumption problem.
result Existence and uniqueness of proper utility processes for a wide class of consumption streams.