An inexact dual logarithmic barrier method for solving sparse semidefinite programs

A dual logarithmic barrier method for solving large, sparse semidefinite programs is proposed in this paper. The method avoids any explicit use of the primal variable X and therefore is well-suited to problems with a sparse dual matrix S. It relies on inexact Newton steps in dual space which are computed by the conjugate gradient method applied to the Schur complement of the reduced KKT system. The method may take advantage of low-rank representations of matrices Ai to perform implicit matrix-vector products with the Schur complement matrix and to compute only specific parts of this matrix. This allows the construction of the partial Cholesky factorization of the Schur complement matrix which serves as a good preconditioner for it and permits the method to be run in a matrix-free scheme. Convergence properties of the method are studied and a polynomial complexity result is extended to the case when inexact Newton steps are employed. A Matlab-based implementation is developed and preliminary computational results of applying the method to maximum cut and matrix completion problems are reported

Estimation of risk-neutral density surfaces

Option price data is often used to infer risk-neutral densities for future prices of an underlying asset. Given the prices of a set of options on the same underlying asset with different strikes and maturities, we propose a nonparametric approach for estimating risk-neutral densities associated with several maturities. Our method uses bicubic splines in order to achieve the desired smoothness for the estimation and an optimization model to choose the spline functions that best fit the price data. Semidefinite programming is employed to guarantee the nonnegativity of the densities. We illustrate the process using synthetic option price data generated using log-normal and absolute diffusion processes as well as actual price data for options on the S&P500 index. We also used the risk-neutral densities that we computed to price exotic options and observed that this approach generates prices that closely approximate the market prices of these options

A characterization of the weighted Lovász number based on convex quadratic programming

Luz and Schrijver (SIAM J Discrete Math 19(2):382–387, 2005) introduced a characterization of the Lovász number based on convex quadratic programming. This characterization is now extended to the weighted version of that number. In consequence, a class of graphs for which the weighted Lovász number coincides with the weighted stability number is characterized. Several examples of graphs of this class are presented

Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem

2015-2016 > Academic research: refereed > Publication in refereed journal202206 bcvcAccepted ManuscriptOthersPolyUPublishe