Search

In this paper, we study the linear complementarity problems on the monotone extended second order cones. We demonstrate that the linear complementarity problem on the monotone extended second order cone can be converted into a mixed complementarity problem on the non-negative orthant. We prove that any point satisfying the FB equation is a solution of the converted problem. We also show that the semi-smooth Newton method could be used to solve the converted problem, and we also provide a numerical example. Finally, we derive the explicit solution to a portfolio optimisation problem based on the monotone extended second order cone., Comment: 22 pages

This paper introduces the monotone extended second-order cone (MESOC), which is related to the monotone cone and the second-order cone. Some properties of the MESOC are presented and its dual cone is computed. Projecting onto the MESOC is reduced to the pool-adjacent-violators algorithm (PAVA) of isotonic regression. An application of MESOC to portfolio optimisation is provided. Some broad descriptions of possible MESOC-regression models are also outlined., Comment: 13 pages

In this paper, we describe the structural properties of the cone of $\mathcal{Z}$-transformations on the second order cone in terms of the semidefinite cone and copositive/completely positive cones induced by the second order cone and its boundary. In particular, we describe its dual as a slice of the semidefinite cone as well as a slice of the completely positive cone of the second order cone. This provides an example of an instance where a conic linear program on a completely positive cone is reduced to a problem on the semidefinite cone.

In this paper, the spherical quasi-convexity of quadratic functions on spherically subdual convex sets is studied. Sufficient conditions for spherical quasi-convexity on spherically subdual convex sets are presented. A partial characterization of spherical quasi-convexity on spherical Lorentz sets is given and some examples are provided.

By using Moreau's decomposition theorem for projecting onto cones, the problem of projecting onto a simplicial cone is reduced to finding the unique solution of a nonsmooth system of equations. It is shown that Picard's method applied to the system of equations associated to the problem of projecting onto a simplicial cone generates a sequence that converges linearly to the solution of the system. Numerical experiments are presented making the comparison between Picard's and semi-smooth Newton's methods to solve the nonsmooth system associated with the problem of projecting a point onto a simplicial cone., Comment: 22 pages. arXiv admin note: text overlap with arXiv:1404.2427

In the present paper, we propose and analyze a novel method for estimating a univariate regression function of bounded variation. The underpinning idea is to combine two classical tools in nonparametric statistics, namely isotonic regression and the estimation of additive models. A geometrical interpretation enables us to link this iterative method with Von Neumann's algorithm. Moreover, making a connection with the general property of isotonicity of projection onto convex cones, we derive another equivalent algorithm and go further in the analysis. As iterating the algorithm leads to overfitting, several practical stopping criteria are also presented and discussed., Comment: 25 pages, 5 figures