Browse
Submit Data
Databases
API
Help

Dataset Information

29 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Constrained portfolio optimization with discrete variables: An algorithmic method based on dynamic programming.

ABSTRACT: Portfolio optimization is one of the most important issues in financial markets. In this regard, the more realistic are assumptions and conditions of modelling to portfolio optimization into financial markets, the more reliable results will be obtained. This paper studies the knapsack-based portfolio optimization problem that involves discrete variables. This model has two very important features; achieving the optimal number of shares as an integer and with masterly efficiency in portfolio optimization for high priced stocks. These features have added some real aspects of financial markets to the model and distinguish them from other previous models. Our contribution is that we present an algorithm based on dynamic programming to solve the portfolio selection model based on the knapsack problem, which is in contrast to the existing literature. Then, to show the applicability and validity of the proposed dynamic programming algorithm, two case studies of the US stock exchange are analyzed.

SUBMITTER: Jezeie FV

PROVIDER: S-EPMC9333297 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Algorithmic portfolio tilting to harvest higher moment gains.

Project description:Many financial portfolios are not mean-variance-skewness-kurtosis efficient. We recommend tilting these portfolios in a direction that increases their estimated mean and third central moment and decreases their variance and fourth central moment. The advantages of tilting come at the cost of deviation from the initial optimality criterion. In this paper, we show the usefulness of portfolio tilting applied to the equally-weighted, equal-risk-contribution and maximum diversification portfolios in a UCITS-compliant asset allocation setting.

| S-EPMC7062767 | biostudies-literature

Firefly algorithm for cardinality constrained mean-variance portfolio optimization problem with entropy diversity constraint.

Project description:Portfolio optimization (selection) problem is an important and hard optimization problem that, with the addition of necessary realistic constraints, becomes computationally intractable. Nature-inspired metaheuristics are appropriate for solving such problems; however, literature review shows that there are very few applications of nature-inspired metaheuristics to portfolio optimization problem. This is especially true for swarm intelligence algorithms which represent the newer branch of nature-inspired algorithms. No application of any swarm intelligence metaheuristics to cardinality constrained mean-variance (CCMV) portfolio problem with entropy constraint was found in the literature. This paper introduces modified firefly algorithm (FA) for the CCMV portfolio model with entropy constraint. Firefly algorithm is one of the latest, very successful swarm intelligence algorithm; however, it exhibits some deficiencies when applied to constrained problems. To overcome lack of exploration power during early iterations, we modified the algorithm and tested it on standard portfolio benchmark data sets used in the literature. Our proposed modified firefly algorithm proved to be better than other state-of-the-art algorithms, while introduction of entropy diversity constraint further improved results.

| S-EPMC4060745 | biostudies-other

SwiftLib: rapid degenerate-codon-library optimization through dynamic programming.

Project description:Degenerate codon (DC) libraries efficiently address the experimental library-size limitations of directed evolution by focusing diversity toward the positions and toward the amino acids (AAs) that are most likely to generate hits; however, manually constructing DC libraries is challenging, error prone and time consuming. This paper provides a dynamic programming solution to the task of finding the best DCs while keeping the size of the library beneath some given limit, improving on the existing integer-linear programming formulation. It then extends the algorithm to consider multiple DCs at each position, a heretofore unsolved problem, while adhering to a constraint on the number of primers needed to synthesize the library. In the two library-design problems examined here, the use of multiple DCs produces libraries that very nearly cover the set of desired AAs while still staying within the experimental size limits. Surprisingly, the algorithm is able to find near-perfect libraries where the ratio of amino-acid sequences to nucleic-acid sequences approaches 1; it effectively side-steps the degeneracy of the genetic code. Our algorithm is freely available through our web server and solves most design problems in about a second.

| S-EPMC4357694 | biostudies-literature

COSMO: A dynamic programming algorithm for multicriteria codon optimization.

Project description:Codon optimization in protein-coding sequences (CDSs) is a widely used technique to promote the heterologous expression of target genes. In codon optimization, a combinatorial space of nucleotide sequences that code a given amino acid sequence and take into account user-prescribed forbidden sequence motifs is explored to optimize multiple criteria. Although evolutionary algorithms have been used to tackle such complex codon optimization problems, evolutionary codon optimization tools do not provide guarantees to find the optimal solutions for these multicriteria codon optimization problems. We have developed a novel multicriteria dynamic programming algorithm, COSMO. By using this algorithm, we can obtain all Pareto-optimal solutions for the multiple features of CDS, which include codon usage, codon context, and the number of hidden stop codons. User-prescribed forbidden sequence motifs are rigorously excluded from the Pareto-optimal solutions. To accelerate CDS design by COSMO, we introduced constraints that reduce the number of Pareto-optimal solutions to be processed in a branch-and-bound manner. We benchmarked COSMO for run-time and the number of generated solutions by adapting selected human genes to yeast codon usage frequencies, and found that the constraints effectively reduce the run-time. In addition to the benchmarking of COSMO, a multi-objective genetic algorithm (MOGA) for CDS design was also benchmarked for the same two aspects and their performances were compared. In this comparison, (i) MOGA identified significantly fewer Pareto-optimal solutions than COSMO, and (ii) the MOGA solutions did not achieve the same mean hypervolume values as those provided by COSMO. These results suggest that generating the whole set of the Pareto-optimal solutions of the codon optimization problems is a difficult task for MOGA.

| S-EPMC7358382 | 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

Hybrid biogeography-based optimization for integer programming.

Project description:Biogeography-based optimization (BBO) is a relatively new bioinspired heuristic for global optimization based on the mathematical models of biogeography. By investigating the applicability and performance of BBO for integer programming, we find that the original BBO algorithm does not perform well on a set of benchmark integer programming problems. Thus we modify the mutation operator and/or the neighborhood structure of the algorithm, resulting in three new BBO-based methods, named BlendBBO, BBO_DE, and LBBO_LDE, respectively. Computational experiments show that these methods are competitive approaches to solve integer programming problems, and the LBBO_LDE shows the best performance on the benchmark problems.

| S-EPMC4065689 | biostudies-other

A parametrically constrained optimization method for fitting sedimentation velocity experiments.

Project description:A method for fitting sedimentation velocity experiments using whole boundary Lamm equation solutions is presented. The method, termed parametrically constrained spectrum analysis (PCSA), provides an optimized approach for simultaneously modeling heterogeneity in size and anisotropy of macromolecular mixtures. The solutions produced by PCSA are particularly useful for modeling polymerizing systems, where a single-valued relationship exists between the molar mass of the growing polymer chain and its corresponding anisotropy. The PCSA uses functional constraints to identify this relationship, and unlike other multidimensional grid methods, assures that only a single molar mass can be associated with a given anisotropy measurement. A description of the PCSA algorithm is presented, as well as several experimental and simulated examples that illustrate its utility and capabilities. The performance advantages of the PCSA method in comparison to other methods are documented. The method has been added to the UltraScan-III software suite, which is available for free download from http://www.ultrascan.uthscsa.edu.

| S-EPMC4008825 | biostudies-literature

Constrained portfolio strategies in a regime-switching economy.

Project description:We implement an allocation strategy through a regime-switching model using recursive utility preferences in an out-of-sample exercise accounting for transaction costs. We study portfolios turnover and leverage, proposing two procedures to constrain the allocation strategies: a low-turnover control (LoT) and a maximum leverage control (MaxLev). LoT sets a dynamic threshold to trim minor rebalancing, reducing portfolio turnover, mitigating costs. MaxLev calculates dynamic adjustments to the risk aversion parameter to constrain the portfolio leverage. The MaxLev adjustments depend on the risk aversion and permitted portfolio leverage, which enables optimal strategies considering the leverage constraints. The study uses US equity portfolios, and shows that, first, models with LoT result in superior return-to-risk measures than those without it when transaction costs increase. Second, considering transaction costs, the return-to-risk measures of the models using MaxLev closely match or exceed those from the corresponding unconstrained regime-switching benchmarks. Third, MaxLev returns have lower volatility and higher return-to-risk than conventional numerically constrained benchmarks. Fourth, the certainty equivalent returns indicate that models using MaxLev and LoT outperform both single-state models and unconstrained regime-switching models with statistical significance.Supplementary informationThe online version contains supplementary material available at 10.1007/s11408-022-00414-x.

| S-EPMC9243879 | biostudies-literature

Robust Portfolio Optimization Using Pseudodistances.

Project description:The presence of outliers in financial asset returns is a frequently occurring phenomenon which may lead to unreliable mean-variance optimized portfolios. This fact is due to the unbounded influence that outliers can have on the mean returns and covariance estimators that are inputs in the optimization procedure. In this paper we present robust estimators of mean and covariance matrix obtained by minimizing an empirical version of a pseudodistance between the assumed model and the true model underlying the data. We prove and discuss theoretical properties of these estimators, such as affine equivariance, B-robustness, asymptotic normality and asymptotic relative efficiency. These estimators can be easily used in place of the classical estimators, thereby providing robust optimized portfolios. A Monte Carlo simulation study and applications to real data show the advantages of the proposed approach. We study both in-sample and out-of-sample performance of the proposed robust portfolios comparing them with some other portfolios known in literature.

| S-EPMC4607458 | biostudies-literature

SCYN: single cell CNV profiling method using dynamic programming

Project description:Background Copy number variation is crucial in deciphering the mechanism and cure of complex disorders and cancers. The recent advancement of scDNA sequencing technology sheds light upon addressing intratumor heterogeneity, detecting rare subclones, and reconstructing tumor evolution lineages at single-cell resolution. Nevertheless, the current circular binary segmentation based approach proves to fail to efficiently and effectively identify copy number shifts on some exceptional trails. Results Here, we propose SCYN, a CNV segmentation method powered with dynamic programming. SCYN resolves the precise segmentation on in silico dataset. Then we verified SCYN manifested accurate copy number inferring on triple negative breast cancer scDNA data, with array comparative genomic hybridization results of purified bulk samples as ground truth validation. We tested SCYN on two datasets of the newly emerged 10x Genomics CNV solution. SCYN successfully recognizes gastric cancer cells from 1% and 10% spike-ins 10x datasets. Moreover, SCYN is about 150 times faster than state of the art tool when dealing with the datasets of approximately 2000 cells. Conclusions SCYN robustly and efficiently detects segmentations and infers copy number profiles on single cell DNA sequencing data. It serves to reveal the tumor intra-heterogeneity. The source code of SCYN can be accessed in https://github.com/xikanfeng2/SCYN. Supplementary Information The online version contains supplementary material available at (10.1186/s12864-021-07941-3).

| S-EPMC8596905 | 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