cone constraints
Recently Published Documents


TOTAL DOCUMENTS

76
(FIVE YEARS 8)

H-INDEX

15
(FIVE YEARS 0)

Algorithms ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 252
Author(s):  
Weiping Wu ◽  
Lifen Wu ◽  
Ruobing Xue ◽  
Shan Pang

This paper revisits the dynamic MV portfolio selection problem with cone constraints in continuous-time. We first reformulate our constrained MV portfolio selection model into a special constrained LQ optimal control model and develop the optimal portfolio policy of our model. In addition, we provide an alternative method to resolve this dynamic MV portfolio selection problem with cone constraints. More specifically, instead of solving the correspondent HJB equation directly, we develop the optimal solution for this problem by using the special properties of value function induced from its model structure, such as the monotonicity and convexity of value function. Finally, we provide an example to illustrate how to use our solution in real application. The illustrative example demonstrates that our dynamic MV portfolio policy dominates the static MV portfolio policy.


4OR ◽  
2021 ◽  
Author(s):  
Adrián Esteban-Pérez ◽  
Juan M. Morales

AbstractIn this paper we wish to tackle stochastic programs affected by ambiguity about the probability law that governs their uncertain parameters. Using optimal transport theory, we construct an ambiguity set that exploits the knowledge about the distribution of the uncertain parameters, which is provided by: (1) sample data and (2) a-priori information on the order among the probabilities that the true data-generating distribution assigns to some regions of its support set. This type of order is enforced by means of order cone constraints and can encode a wide range of information on the shape of the probability distribution of the uncertain parameters such as information related to monotonicity or multi-modality. We seek decisions that are distributionally robust. In a number of practical cases, the resulting distributionally robust optimization (DRO) problem can be reformulated as a finite convex problem where the a-priori information translates into linear constraints. In addition, our method inherits the finite-sample performance guarantees of the Wasserstein-metric-based DRO approach proposed by Mohajerin Esfahani and Kuhn (Math Program 171(1–2):115–166. 10.1007/s10107-017-1172-1, 2018), while generalizing this and other popular DRO approaches. Finally, we have designed numerical experiments to analyze the performance of our approach with the newsvendor problem and the problem of a strategic firm competing à la Cournot in a market.


2020 ◽  
Vol 30 (2) ◽  
pp. 121-136
Author(s):  
Ashish Prasad ◽  
Anant Singh ◽  
Sony Khatri

The present work frames a pair of symmetric dual problems for second order nondifferentiable fractional variational problems over cone constraints with the help of support functions. Weak, strong and converse duality theorems are derived under second order F-convexity assumptions. By removing time dependency, static case of the problem is obtained. Suitable numerical example is constructed.


2020 ◽  
Vol 16 (4) ◽  
pp. 1873-1884
Author(s):  
Liping Tang ◽  
◽  
Xinmin Yang ◽  
Ying Gao ◽  
◽  
...  

Mathematics ◽  
2018 ◽  
Vol 6 (11) ◽  
pp. 270
Author(s):  
Ali Sadeghi ◽  
Mansour Saraj ◽  
Nezam Amiri

In this article, a methodology is developed to solve an interval and a fractional interval programming problem by converting into a non-interval form for second order cone constraints, with the objective function and constraints being interval valued functions. We investigate the parametric and non-parametric forms of the interval valued functions along with their convexity properties. Two approaches are developed to obtain efficient and properly efficient solutions. Furthermore, the efficient solutions or Pareto optimal solutions of fractional and non-fractional programming problems over R + n ⋃ { 0 } are also discussed. The main idea of the present article is to introduce a new concept for efficiency, called efficient space, caused by the lower and upper bounds of the respective intervals of the objective function which are shown in different figures. Finally, some numerical examples are worked through to illustrate the methodology and affirm the validity of the obtained results.


Sign in / Sign up

Export Citation Format

Share Document