Markowitz's Portfolio Simulator

This project is already pluged in to Interactive Brokers C++ API  beta test will begin soon;  ref: ExSan
Algorithmic Trading - LOW LATENCY TRADING
    1 Markowitz Portfolio Simulator
    2 
    3 ExSan is used for this simulation, Yahoo Finance is the source of data. 
    4 About  +500 files in txt format,  each containing 4K to 7K closing stok’s 
    5 prices since Jan 2000.
    6 
    7 ExSan handles DYNAMIC MEMORY ALLOCATION  it can deal with more than +500
    8 stocks/assets, it is only limited by the amount of RAM installed and 
    9 the addressable memory
   10 
   11 At the beginning all +500 files are opened and right away their access 
   12 pointers are randomly shifted to a new position, so every time the 
   13 portfolio simulator is executed the scenario is does not repeat because 
   14 at the very simulation all data files start to be read at a random position 
   15 from their beginning. Data files remain open during the whole simulation 
   16 for sequential access of its content. data files are picked  randomly to 
   17 read a new value (stock price) that will be feeded into the simulator
   18 
   19 This Simulator has been implemented using  Markowitz’s Portfolio Optimization
   20 Theory ( Quant Finance), it uses matrix generalization version that is based 
   21 on  Lagrange’s Theorem  , maximum return has been implemented 
   22 
   23 Here some printouts

   23    more --- try here

Flag Counter

Comments

Post a Comment

Popular posts from this blog

🔥 ExSan Pushing the Limits of High-Frequency Trading with C++ 🔥

Image
High-Frequency Trading with C++ — Blog Update 🔗 Check out the live post on LinkedIn In the initial implementation, a new cluster was created each time new data was read from the simulator's data stream. I observed that this approach resulted in significant time consumption due to the repeated creation and deletion of clusters. To address this, I developed a method to reuse the originally created cluster, substantially reducing overhead. The method for this improved version is quite simple: the clusters are declared static from the beginning, allowing them to persist and be reused. Because of the nature of the clusters — they are implemented as Red-Black Trees — if there are not enough nodes to accommodate new data, the code simply adds additional nodes dynamically, allowing for seamless expansion. This optimization was applied while feeding ExSan with my market simulator, which mimics the asynchronicity of ...
Read more

Inside the Engine: A Code-Level Look at ExSan CODE’s Processing Clusters

Image
ExSan c++ |ExSan| ++ ↄ Simply Raw Pointers iX     ilinkedIn         exsan.plusplus@gmail.com   Sat Apr 19 10:17:38 2025         x: R.J.Y       JOB: xsnPtfli_1738xsnPtfli OUTPUT        Clusterig      The Code itself        1     //-------------at the end of the data capture --here clustering-------//        2     frameClk[1] = pt::microsec_clock::local_time();        3     ++frameCounterDatum;  //every time a datum into new db? it could be where data is captured¡¡¡¡????         4    ...
Read more

Backtesting Pipeline Feed to ExSan & Clustering Setup 178 °°°°° 42 Assets each 5 clusters Timing Cluster 10000 micro Seconds 10 mili Seconds

Image
ExSan c++ |ExSan| ++ ↄ iX     ilinkedIn         exsan.plusplus@gmail.com   Sat Apr 19 09:24:19 2025         x: R.J.Y       JOB: xsnPtfli_2419xsnPtfli OUTPUT        Clusterig      The Code itself        1         2     |ExSan| C++  |ExSan||ExSan| C++  |ExSan|                                 Sat Apr 19 09:24:19 2025        3         4     JOB:  xsnPtfli_2419        5     GLUTo Thu...
Read more