A successive SDP-NSDP approach to a robust optimization problem in finance

A successive SDP-NSDP approach to a robust optimization problem in finance

0.00 Avg rating0 Votes
Article ID: iaor200973457
Volume: 44
Issue: 3
Start Page Number: 443
End Page Number: 466
Publication Date: Dec 2009
Journal: Computational Optimization and Applications
Authors: ,
Keywords: programming: mathematical
Abstract:

The robustification of trading strategies is of particular interest in financial market applications. In this paper we robustify a portfolio strategy recently introduced in the literature against model errors in the sense of a worst case design. As it turns out, the resulting optimization problem can be solved by a sequence of linear and nonlinear semidefinite programs (SDP/NSDP), where the nonlinearity is introduced by the parameters of a parabolic differential equation. The nonlinear semidefinite program naturally arises in the computation of the worst case constraint violation which is equivalent to an eigenvalue minimization problem. Further we prove convergence for the iterates generated by the sequential SDP-NSDP approach.

Reviews

Required fields are marked *. Your email address will not be published.