An efficient DC programming approach for portfolio decision with higher moments
From MaRDI portal
Publication:409263
DOI10.1007/s10589-010-9383-xzbMath1237.90186OpenAlexW2038323532MaRDI QIDQ409263
Publication date: 12 April 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9383-x
Related Items (5)
DC Programming Approaches for BMI and QMI Feasibility Problems ⋮ A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program ⋮ Dynamic Score-Driven Independent Component Analysis ⋮ DC programming and DCA: thirty years of developments ⋮ Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem
Uses Software
Cites Work
- Unnamed Item
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Conditional volatility, skewness, and kurtosis: Existence, persistence, and comovements
- Finding a maximum skewness portfolio -- a general solution to three-moments portfolio choice
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
- Exact penalty in d. c. programming
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- DC programming: overview.
- Finding largest small polygons with gloptipoly
- Global Optimization with Polynomials and the Problem of Moments
- Markowitz Revisited: Mean-Variance Models in Financial Portfolio Analysis
- GloptiPoly 3: moments, optimization and semidefinite programming
- Global Optimization of the Scenario Generation and Portfolio Selection Problems
- A DC Programming Approach for Mixed-Integer Linear Programs
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- GloptiPoly
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
- Convex Analysis
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Introduction to global optimization.
This page was built for publication: An efficient DC programming approach for portfolio decision with higher moments
