Sparse Non-Convex Optimization For Higher Moment Portfolio Management

01/04/2022
by   Farshad Noravesh, et al.
0

One of the reasons that higher order moment portfolio optimization methods are not fully used by practitioners in investment decisions is the complexity that these higher moments create by making the optimization problem nonconvex. Many few methods and theoretical results exists in the literature, but the present paper uses the method of successive convex approximation for the mean-variance-skewness problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2017

Lower Bounds for Higher-Order Convex Optimization

State-of-the-art methods in convex and non-convex optimization employ hi...
research
10/15/2019

On Higher-order Moments in Adam

In this paper, we investigate the popular deep learning optimization rou...
research
05/17/2018

Parallel and Distributed Successive Convex Approximation Methods for Big-Data Optimization

Recent years have witnessed a surge of interest in parallel and distribu...
research
07/28/2017

Efficient Algorithms for Non-convex Isotonic Regression through Submodular Optimization

We consider the minimization of submodular functions subject to ordering...
research
11/06/2018

Double Adaptive Stochastic Gradient Optimization

Adaptive moment methods have been remarkably successful in deep learning...
research
08/07/2017

The discrete moment problem with nonconvex shape constraints

The discrete moment problem is a foundational problem in distribution-fr...
research
01/01/2022

Some connections between higher moments portfolio optimization methods

In this paper, different approaches to portfolio optimization having hig...

Please sign up or login with your details

Forgot password? Click here to reset