Technology and Investment

Volume 2, Issue 4 (November 2011)

ISSN Print: 2150-4059   ISSN Online: 2150-4067

Google-based Impact Factor: 1.39  Citations  

An Efficient and Concise Algorithm for Convex Quadratic Programming and Its Application to Markowitz’s Portfolio Selection Model

HTML  Download Download as PDF (Size: 284KB)  PP. 229-239  
DOI: 10.4236/ti.2011.24024    9,261 Downloads   13,501 Views  Citations

Affiliation(s)

.

ABSTRACT

This paper presents a pivoting-based method for solving convex quadratic programming and then shows how to use it together with a parameter technique to solve mean-variance portfolio selection problems.

Share and Cite:

Zhang, Z. and Zhang, H. (2011) An Efficient and Concise Algorithm for Convex Quadratic Programming and Its Application to Markowitz’s Portfolio Selection Model. Technology and Investment, 2, 229-239. doi: 10.4236/ti.2011.24024.

Cited by

[1] The downside deviation quadratic programming for stock portfolio optimisation: an empirical study of shariah and conventional indices in Indonesia
Afro-Asian Journal of …, 2024
[2] A Review on Shariah Stock Portfolio Optimization
DLSU Business & Economics Review, 2021
[3] A Review on Shariah Stock Portfolio Optimization.
DLSU Business & Economics Review, 2021
[4] Quadratic Programming for Optimizing the Diversified Shariah Stock Portfolio
2020
[5] Optimal Portfolio Selection: Comparison of Different Methods Based on Real Life Financial Data
2020
[6] Cálculo de constantes ópticas de películas delgadas de Cu3BiS3 a través del método de Wolfe
Universitas Scientiarum, 2014
[7] Calculation of the optical constants of Cu3BiS3 thin films using the Wolfe method
Universitas Scientiarum, 2014
[8] An improved detection algorithm based on Lattice reduction for MIMO system
Personal, Indoor, and Mobile Radio Communication (PIMRC), 2014 IEEE 25th Annual International Symposium on, 2014

Copyright © 2025 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.