Browse
Submit Data
Databases
API
Help

Dataset Information

25 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Numerical solution of a general interval quadratic programming model for portfolio selection.

ABSTRACT: Based on the Markowitz mean variance model, this paper discusses the portfolio selection problem in an uncertain environment. To construct a more realistic and optimized model, in this paper, a new general interval quadratic programming model for portfolio selection is established by introducing the linear transaction costs and liquidity of the securities market. Regarding the estimation for the new model, we propose an effective numerical solution method based on the Lagrange theorem and duality theory, which can obtain the effective upper and lower bounds of the objective function of the model. In addition, the proposed method is illustrated with two examples, and the results show that the proposed method is better and more feasible than the commonly used portfolio selection method.

SUBMITTER: Wang J

PROVIDER: S-EPMC6415890 | biostudies-literature | 2019

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Numerical solution of a general interval quadratic programming model for portfolio selection.

Wang Jianjian J He Feng F Shi Xin X

PloS one 20190313 3

Based on the Markowitz mean variance model, this paper discusses the portfolio selection problem in an uncertain environment. To construct a more realistic and optimized model, in this paper, a new general interval quadratic programming model for portfolio selection is established by introducing the linear transaction costs and liquidity of the securities market. Regarding the estimation for the new model, we propose an effective numerical solution method based on the Lagrange theorem and dualit ...[more]

PMID: 30865676

Similar Datasets

Tableau-based protein substructure search using quadratic programming.

Project description:BACKGROUND: Searching for proteins that contain similar substructures is an important task in structural biology. The exact solution of most formulations of this problem, including a recently published method based on tableaux, is too slow for practical use in scanning a large database. RESULTS: We developed an improved method for detecting substructural similarities in proteins using tableaux. Tableaux are compared efficiently by solving the quadratic program (QP) corresponding to the quadratic integer program (QIP) formulation of the extraction of maximally-similar tableaux. We compare the accuracy of the method in classifying protein folds with some existing techniques. CONCLUSION: We find that including constraints based on the separation of secondary structure elements increases the accuracy of protein structure search using maximally-similar subtableau extraction, to a level where it has comparable or superior accuracy to existing techniques. We demonstrate that our implementation is able to search a structural database in a matter of hours on a standard PC.

| S-EPMC2705363 | biostudies-literature

A portfolio selection model based on the knapsack problem under uncertainty.

Project description:One of the primary concerns in investment planning is to determine the number of shares for asset with relatively high net value of share such as Berkshire Hathaway on Stock market. Traditional asset allocation methods like Markowitz theorem gives the solution as a percentage and this ratio may suggest allocation of half of a share on the market, which is impractical. Thus, it is necessary to propose a method to determine the number of shares for each asset. This paper presents a knapsack based portfolio selection model where the expected returns, prices, and budget are characterized by interval values. The study determines the priority and importance of each share in the proposed model by extracting the interval weights from an interval comparison matrix. The resulted model is converted into a parametric linear programming model in which the decision maker is able to determine the optimism threshold. Finally, a discrete firefly algorithm is designed to find the near optional solutions in large dimensions. The proposed study is implemented for some data from the US stock exchange.

| S-EPMC6493714 | biostudies-literature

Intrinsic RGB and multispectral images recovery by independent quadratic programming.

Project description:This work introduces a method to estimate reflectance, shading, and specularity from a single image. Reflectance, shading, and specularity are intrinsic images derived from the dichromatic model. Estimation of these intrinsic images has many applications in computer vision such as shape recovery, specularity removal, segmentation, or classification. The proposed method allows for recovering the dichromatic model parameters thanks to two independent quadratic programming steps. Compared to the state of the art in this domain, our approach has the advantage to address a complex inverse problem into two parallelizable optimization steps that are easy to solve and do not require learning. The proposed method is an extension of a previous algorithm that is rewritten to be numerically more stable, has better quantitative and qualitative results, and applies to multispectral images. The proposed method is assessed qualitatively and quantitatively on standard RGB and multispectral datasets.

| S-EPMC7924503 | biostudies-literature

Biped Walking Based on Stiffness Optimization and Hierarchical Quadratic Programming.

Project description:The spring-loaded inverted pendulum model is similar to human walking in terms of the center of mass (CoM) trajectory and the ground reaction force. It is thus widely used in humanoid robot motion planning. A method that uses a velocity feedback controller to adjust the landing point of a robot leg is inaccurate in the presence of disturbances and a nonlinear optimization method with multiple variables is complicated and thus unsuitable for real-time control. In this paper, to achieve real-time optimization, a CoM-velocity feedback controller is used to calculate the virtual landing point. We construct a touchdown return map based on a virtual landing point and use nonlinear least squares to optimize spring stiffness. For robot whole-body control, hierarchical quadratic programming optimization is used to achieve strict task priority. The dynamic equation is given the highest priority and inverse dynamics are directly used to solve it, reducing the number of optimizations. Simulation and experimental results show that a force-controlled biped robot with the proposed method can stably walk on unknown uneven ground with a maximum obstacle height of 5 cm. The robot can recover from a 5 Nm disturbance during walking without falling.

| S-EPMC7957877 | biostudies-literature

Numerical approximation to the general kinetic model for ASL quantification.

Project description:PurposeTo develop a numerical approximation to the general kinetic model for arterial spin labeling (ASL) quantification that will enable greater flexibility in ASL acquisition methods.TheoryThe Bloch-McConnell equations are extended to include the effects of single-compartment inflow and outflow on both the transverse and longitudinal magnetization. These can be solved using an extension of Jaynes' matrix formalism with piecewise constant approximation of incoming labeled arterial flow and a clearance operator for outgoing venous flow.MethodsThe proposed numerical approximation is compared with the general kinetic model using simulations of pulsed labeling and pseudo-continuous labeling and a broad range of transit time and bolus duration for tissue blood flow of 0.6 mL/g/min. Accuracy of the approximation is studied as a function of the timestep using Monte-Carlo simulations. Three additional scenarios are demonstrated: (1) steady-pulsed ASL, (2) MR fingerprinting ASL, and (3) balanced SSFP and spoiled gradient-echo sequences.ResultsThe proposed approximation was found to be arbitrarily accurate for pulsed labeling and pseudo-continuous labeling. The pulsed labeling/pseudo-continuous labeling approximation error compared with the general kinetic model was less than 0.002% (<0.002%) and less than 0.05% (<0.05%) for timesteps of 3 ms and 35 ms, respectively. The proposed approximation matched well with customized signal expressions of steady-pulsed ASL and MR fingerprinting ASL. The simulations of simultaneous modeling of flow, T2 , and magnetization transfer showed an increase in steady-state balanced SSFP and spoiled gradient signals.ConclusionWe demonstrate a numerical approximation of the "Bloch-McConnell flow" equations that enables arbitrarily accurate modeling of pulsed ASL and pseudo-continuous labeling signals comparable to the general kinetic model. This enables increased flexibility in the experiment design for quantitative ASL.

| S-EPMC7402027 | biostudies-literature

General solution model and its new progress

Project description:The physicochemical properties of multicomponent systems are involved in all fields of chemistry and have received attention from various related areas such as minerals, metallurgy, material science, environment, biology, and agriculture. At present, the relevant data can be obtained by using two major calculation methods, namely, the first principle method and the empirical method. Though the former has achieved recent great progress, it is still a long way to offer practical data; while the latter has not received progress for almost half a century. Therefore, a new method that is theoretically reasonable and accurate in practical application is necessary to obtain practical and precise physicochemical data for ternary and multicomponent systems. In this paper, a new theoretical model is suggested based on its corresponding binary ones. The feasibility of this theoretical model is discussed in terms of both theoretical analysis and practical performance. Supplementary Information The online version contains supplementary material available at 10.1007/s12613-022-2411-x.

| S-EPMC8985750 | biostudies-literature

Fuzzy Portfolio Selection Using Stochastic Correlation

Project description:Here we have proposed fuzzy portfolio selection model using stochastic correlation (FPSMSC) to overcome limitations both in fuzzy and stochastic world. The newly proposed model not only gets harmonious efficient frontier, but also considers the future movement of stock prices based on fuzzy expertise knowledge. The investment weights of the model have been optimized based on the monthly return data of 18 stocks listed in S&P500 from October 2011 to September 2015. The proposed model has provided higher returns in the whole regime of risk for the period from October 2014 to September 2015, whose monthly return data are used as training data than other available portfolio selection models, i.e., fuzzy portfolio selection models with credibility and possibility and statistic model. Also, the present model has shown the better smoothness of the variations of returns with respect to risk aversion parameter, λ, from the monthly data from October 2015 to September 2016, which is not included to training database. Especially, our model is superior to other models in the regime of 0–0.3 for the risk aversion level. It is demonstrating that the FPSMSC is efficient for the investors who tend to seek the high return in portfolio management. Supplementary Information The online version contains supplementary material available at 10.1007/s10614-023-10371-w.

| S-EPMC9983516 | biostudies-literature

Real-world datasets for portfolio selection and solutions of some stochastic dominance portfolio models.

Project description:A large number of portfolio selection models have appeared in the literature since the pioneering work of Markowitz. However, even when computational and empirical results are described, they are often hard to replicate and compare due to the unavailability of the datasets used in the experiments. We provide here several datasets for portfolio selection generated using real-world price values from several major stock markets. The datasets contain weekly return values, adjusted for dividends and for stock splits, which are cleaned from errors as much as possible. The datasets are available in different formats, and can be used as benchmarks for testing the performances of portfolio selection models and for comparing the efficiency of the algorithms used to solve them. We also provide, for these datasets, the portfolios obtained by several selection strategies based on Stochastic Dominance models (see "On Exact and Approximate Stochastic Dominance Strategies for Portfolio Selection" (Bruni et al. [2])). We believe that testing portfolio models on publicly available datasets greatly simplifies the comparison of the different portfolio selection strategies.

| S-EPMC4959918 | biostudies-literature

Learning zero-cost portfolio selection with pattern matching.

Project description:We replicate and extend the adversarial expert based learning approach of Györfi et al to the situation of zero-cost portfolio selection implemented with a quadratic approximation derived from the mutual fund separation theorems. The algorithm is applied to daily sampled sequential Open-High-Low-Close data and sequential intraday 5-minute bar-data from the Johannesburg Stock Exchange (JSE). Statistical tests of the algorithms are considered. The algorithms are directly compared to standard NYSE test cases from prior literature. The learning algorithm is used to select parameters for experts generated by pattern matching past dynamics using a simple nearest-neighbour search algorithm. It is shown that there is a speed advantage associated with using an analytic solution of the mutual fund separation theorems. We argue that the strategies are on the boundary of profitability when considered in the context of their application to intraday quantitative trading but demonstrate that patterns in financial time-series on the JSE could be systematically exploited in collective and that they are persistent in the data investigated. We do not suggest that the strategies can be profitably implemented but argue that these types of patterns may exists for either structural of implementation cost reasons.

| S-EPMC6155486 | biostudies-literature

Constrained optimization as ecological dynamics with applications to random quadratic programming in high dimensions.

Project description:Quadratic programming (QP) is a common and important constrained optimization problem. Here, we derive a surprising duality between constrained optimization with inequality constraints, of which QP is a special case, and consumer resource models describing ecological dynamics. Combining this duality with a recent "cavity solution," we analyze high-dimensional, random QP where the optimization function and constraints are drawn randomly. Our theory shows remarkable agreement with numerics and points to a deep connection between optimization, dynamical systems, and ecology.

| S-EPMC6717431 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data