25,081 research outputs found
Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming
In this paper we will discuss two variants of an inexact feasible interior
point algorithm for convex quadratic programming. We will consider two
different neighbourhoods: a (small) one induced by the use of the Euclidean
norm which yields a short-step algorithm and a symmetric one induced by the use
of the infinity norm which yields a (practical) long-step algorithm. Both
algorithms allow for the Newton equation system to be solved inexactly. For
both algorithms we will provide conditions for the level of error acceptable in
the Newton equation and establish the worst-case complexity results
Differential-Algebraic Equations and Beyond: From Smooth to Nonsmooth Constrained Dynamical Systems
The present article presents a summarizing view at differential-algebraic
equations (DAEs) and analyzes how new application fields and corresponding
mathematical models lead to innovations both in theory and in numerical
analysis for this problem class. Recent numerical methods for nonsmooth
dynamical systems subject to unilateral contact and friction illustrate the
topicality of this development.Comment: Preprint of Book Chapte
Application of Operator Splitting Methods in Finance
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 generalizations thereof. An overview of various
operator splitting methods is presented for the efficient numerical solution of
these problems.
Splitting schemes of the Alternating Direction Implicit (ADI) type are
discussed for multidimensional problems, e.g. given by stochastic volatility
(SV) models. For jump models Implicit-Explicit (IMEX) methods are considered
which efficiently treat the nonlocal jump operator. For American options an
easy-to-implement operator splitting method is described for the resulting
linear complementarity problems.
Numerical experiments are presented to illustrate the actual stability and
convergence of the splitting schemes. Here European and American put options
are considered under four asset price models: the classical Black-Scholes
model, the Merton jump-diffusion model, the Heston SV model, and the Bates SV
model with jumps
A sequential semidefinite programming method and an application in passive reduced-order modeling
We consider the solution of nonlinear programs with nonlinear
semidefiniteness constraints. The need for an efficient exploitation of the
cone of positive semidefinite matrices makes the solution of such nonlinear
semidefinite programs more complicated than the solution of standard nonlinear
programs. In particular, a suitable symmetrization procedure needs to be chosen
for the linearization of the complementarity condition. The choice of the
symmetrization procedure can be shifted in a very natural way to certain linear
semidefinite subproblems, and can thus be reduced to a well-studied problem.
The resulting sequential semidefinite programming (SSP) method is a
generalization of the well-known SQP method for standard nonlinear programs. We
present a sensitivity result for nonlinear semidefinite programs, and then
based on this result, we give a self-contained proof of local quadratic
convergence of the SSP method. We also describe a class of nonlinear
semidefinite programs that arise in passive reduced-order modeling, and we
report results of some numerical experiments with the SSP method applied to
problems in that class
On the cone eigenvalue complementarity problem for higher-order tensors
In this paper, we consider the tensor generalized eigenvalue complementarity
problem (TGEiCP), which is an interesting generalization of matrix eigenvalue
complementarity problem (EiCP). First, we given an affirmative result showing
that TGEiCP is solvable and has at least one solution under some reasonable
assumptions. Then, we introduce two optimization reformulations of TGEiCP,
thereby beneficially establishing an upper bound of cone eigenvalues of
tensors. Moreover, some new results concerning the bounds of number of
eigenvalues of TGEiCP further enrich the theory of TGEiCP. Last but not least,
an implementable projection algorithm for solving TGEiCP is also developed for
the problem under consideration. As an illustration of our theoretical results,
preliminary computational results are reported.Comment: 26 pages, 2 figures, 3 table
- …