A multiobjective model for passive portfolio management: an application on the S&P 100 index

This is an author's accepted manuscript of an article published in: “Journal of Business Economics and Management"; Volume 14, Issue 4, 2013; copyright Taylor & Francis; available online at: http://dx.doi.org/10.3846/16111699.2012.668859Index tracking seeks to minimize the unsystematic risk component by imitating the movements of a reference index. Partial index tracking only considers a subset of the stocks in the index, enabling a substantial cost reduction in comparison with full tracking. Nevertheless, when heterogeneous investment profiles are to be satisfied, traditional index tracking techniques may need different stocks to build the different portfolios. The aim of this paper is to propose a methodology that enables a fund s manager to satisfy different clients investment profiles but using in all cases the same subset of stocks, and considering not only one particular criterion but a compromise between several criteria. For this purpose we use a mathematical programming model that considers the tracking error variance, the excess return and the variance of the portfolio plus the curvature of the tracking frontier. The curvature is not defined for a particular portfolio, but for all the portfolios in the tracking frontier. This way funds managers can offer their clients a wide range of risk-return combinations just picking the appropriate portfolio in the frontier, all of these portfolios sharing the same shares but with different weights. An example of our proposal is applied on the S&P 100.García García, F.; Guijarro Martínez, F.; Moya Clemente, I. (2013). A multiobjective model for passive portfolio management: an application on the S&P 100 index. Journal of Business Economics and Management. 14(4):758-775. doi:10.3846/16111699.2012.668859S758775144Aktan, B., Korsakienė, R., & Smaliukienė, R. (2010). TIME‐VARYING VOLATILITY MODELLING OF BALTIC STOCK MARKETS. Journal of Business Economics and Management, 11(3), 511-532. doi:10.3846/jbem.2010.25Ballestero, E., & Romero, C. (1991). A theorem connecting utility function optimization and compromise programming. Operations Research Letters, 10(7), 421-427. doi:10.1016/0167-6377(91)90045-qBeasley, J. E. (1990). OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society, 41(11), 1069-1072. doi:10.1057/jors.1990.166Beasley, J. E., Meade, N., & Chang, T.-J. (2003). An evolutionary heuristic for the index tracking problem. European Journal of Operational Research, 148(3), 621-643. doi:10.1016/s0377-2217(02)00425-3Canakgoz, N. A., & Beasley, J. E. (2009). Mixed-integer programming approaches for index tracking and enhanced indexation. European Journal of Operational Research, 196(1), 384-399. doi:10.1016/j.ejor.2008.03.015Connor, G., & Leland, H. (1995). Cash Management for Index Tracking. Financial Analysts Journal, 51(6), 75-80. doi:10.2469/faj.v51.n6.1952Corielli, F., & Marcellino, M. (2006). Factor based index tracking. Journal of Banking & Finance, 30(8), 2215-2233. doi:10.1016/j.jbankfin.2005.07.012Derigs, U., & Nickel, N.-H. (2004). On a Local-Search Heuristic for a Class of Tracking Error Minimization Problems in Portfolio Management. Annals of Operations Research, 131(1-4), 45-77. doi:10.1023/b:anor.0000039512.98833.5aDose, C., & Cincotti, S. (2005). Clustering of financial time series with application to index and enhanced index tracking portfolio. Physica A: Statistical Mechanics and its Applications, 355(1), 145-151. doi:10.1016/j.physa.2005.02.078Focardi, S. M., & Fabozzi 3, F. J. (2004). A methodology for index tracking based on time-series clustering. Quantitative Finance, 4(4), 417-425. doi:10.1080/14697680400008668Gaivoronski, A. A., Krylov, S., & van der Wijst, N. (2005). Optimal portfolio selection and dynamic benchmark tracking. European Journal of Operational Research, 163(1), 115-131. doi:10.1016/j.ejor.2003.12.001Hallerbach, W. G., & Spronk, J. (2002). The relevance of MCDM for financial decisions. Journal of Multi-Criteria Decision Analysis, 11(4-5), 187-195. doi:10.1002/mcda.328Jarrett, J. E., & Schilling, J. (2008). DAILY VARIATION AND PREDICTING STOCK MARKET RETURNS FOR THE FRANKFURTER BÖRSE (STOCK MARKET). Journal of Business Economics and Management, 9(3), 189-198. doi:10.3846/1611-1699.2008.9.189-198Roll, R. (1992). A Mean/Variance Analysis of Tracking Error. The Journal of Portfolio Management, 18(4), 13-22. doi:10.3905/jpm.1992.701922Rudolf, M., Wolter, H.-J., & Zimmermann, H. (1999). A linear model for tracking error minimization. Journal of Banking & Finance, 23(1), 85-103. doi:10.1016/s0378-4266(98)00076-4Ruiz-Torrubiano, R., & Suárez, A. (2008). A hybrid optimization approach to index tracking. Annals of Operations Research, 166(1), 57-71. doi:10.1007/s10479-008-0404-4Rutkauskas, A. V., & Stasytyte, V. (s. f.). Decision Making Strategies in Global Exchange and Capital Markets. Advances and Innovations in Systems, Computing Sciences and Software Engineering, 17-22. doi:10.1007/978-1-4020-6264-3_4Tabata, Y., & Takeda, E. (1995). Bicriteria Optimization Problem of Designing an Index Fund. Journal of the Operational Research Society, 46(8), 1023-1032. doi:10.1057/jors.1995.139Teresienė, D. (2009). LITHUANIAN STOCK MARKET ANALYSIS USING A SET OF GARCH MODELS. Journal of Business Economics and Management, 10(4), 349-360. doi:10.3846/1611-1699.2009.10.349-36

Novel Artificial Human Optimization Field Algorithms - The Beginning

New Artificial Human Optimization (AHO) Field Algorithms can be created from scratch or by adding the concept of Artificial Humans into other existing Optimization Algorithms. Particle Swarm Optimization (PSO) has been very popular for solving complex optimization problems due to its simplicity. In this work, new Artificial Human Optimization Field Algorithms are created by modifying existing PSO algorithms with AHO Field Concepts. These Hybrid PSO Algorithms comes under PSO Field as well as AHO Field. There are Hybrid PSO research articles based on Human Behavior, Human Cognition and Human Thinking etc. But there are no Hybrid PSO articles which based on concepts like Human Disease, Human Kindness and Human Relaxation. This paper proposes new AHO Field algorithms based on these research gaps. Some existing Hybrid PSO algorithms are given a new name in this work so that it will be easy for future AHO researchers to find these novel Artificial Human Optimization Field Algorithms. A total of 6 Artificial Human Optimization Field algorithms titled "Human Safety Particle Swarm Optimization (HuSaPSO)", "Human Kindness Particle Swarm Optimization (HKPSO)", "Human Relaxation Particle Swarm Optimization (HRPSO)", "Multiple Strategy Human Particle Swarm Optimization (MSHPSO)", "Human Thinking Particle Swarm Optimization (HTPSO)" and "Human Disease Particle Swarm Optimization (HDPSO)" are tested by applying these novel algorithms on Ackley, Beale, Bohachevsky, Booth and Three-Hump Camel Benchmark Functions. Results obtained are compared with PSO algorithm.Comment: 25 pages, 41 figure

Cluster-Based Optimization of Cellular Materials and Structures for Crashworthiness

The objective of this work is to establish a cluster-based optimization method for the optimal design of cellular materials and structures for crashworthiness, which involves the use of nonlinear, dynamic finite element models. The proposed method uses a cluster-based structural optimization approach consisting of four steps: conceptual design generation, clustering, metamodel-based global optimization, and cellular material design. The conceptual design is generated using structural optimization methods. K-means clustering is applied to the conceptual design to reduce the dimensional of the design space as well as define the internal architectures of the multimaterial structure. With reduced dimension space, global optimization aims to improve the crashworthiness of the structure can be performed efficiently. The cellular material design incorporates two homogenization methods, namely, energy-based homogenization for linear and nonlinear elastic material models and mean-field homogenization for (fully) nonlinear material models. The proposed methodology is demonstrated using three designs for crashworthiness that include linear, geometrically nonlinear, and nonlinear models

The True Destination of EGO is Multi-local Optimization

Efficient global optimization is a popular algorithm for the optimization of expensive multimodal black-box functions. One important reason for its popularity is its theoretical foundation of global convergence. However, as the budgets in expensive optimization are very small, the asymptotic properties only play a minor role and the algorithm sometimes comes off badly in experimental comparisons. Many alternative variants have therefore been proposed over the years. In this work, we show experimentally that the algorithm instead has its strength in a setting where multiple optima are to be identified

Binary Particle Swarm Optimization based Biclustering of Web usage Data

Web mining is the nontrivial process to discover valid, novel, potentially useful knowledge from web data using the data mining techniques or methods. It may give information that is useful for improving the services offered by web portals and information access and retrieval tools. With the rapid development of biclustering, more researchers have applied the biclustering technique to different fields in recent years. When biclustering approach is applied to the web usage data it automatically captures the hidden browsing patterns from it in the form of biclusters. In this work, swarm intelligent technique is combined with biclustering approach to propose an algorithm called Binary Particle Swarm Optimization (BPSO) based Biclustering for Web Usage Data. The main objective of this algorithm is to retrieve the global optimal bicluster from the web usage data. These biclusters contain relationships between web users and web pages which are useful for the E-Commerce applications like web advertising and marketing. Experiments are conducted on real dataset to prove the efficiency of the proposed algorithms

An Improved Differential Evolution Algorithm for Maritime Collision Avoidance Route Planning

High accuracy navigation and surveillance systems are pivotal to ensure efficient ship route planning and marine safety. Based on existing ship navigation and maritime collision prevention rules, an improved approach for collision avoidance route planning using a differential evolution algorithm was developed. Simulation results show that the algorithm is capable of significantly enhancing the optimized route over current methods. It has the potential to be used as a tool to generate optimal vessel routing in the presence of conflicts

Formal Proofs for Nonlinear Optimization

We present a formally verified global optimization framework. Given a semialgebraic or transcendental function $f$ and a compact semialgebraic domain $K$, we use the nonlinear maxplus template approximation algorithm to provide a certified lower bound of $f$ over $K$. This method allows to bound in a modular way some of the constituents of $f$ by suprema of quadratic forms with a well chosen curvature. Thus, we reduce the initial goal to a hierarchy of semialgebraic optimization problems, solved by sums of squares relaxations. Our implementation tool interleaves semialgebraic approximations with sums of squares witnesses to form certificates. It is interfaced with Coq and thus benefits from the trusted arithmetic available inside the proof assistant. This feature is used to produce, from the certificates, both valid underestimators and lower bounds for each approximated constituent. The application range for such a tool is widespread; for instance Hales' proof of Kepler's conjecture yields thousands of multivariate transcendental inequalities. We illustrate the performance of our formal framework on some of these inequalities as well as on examples from the global optimization literature.Comment: 24 pages, 2 figures, 3 table