A global optimization problem in portfolio selection
From MaRDI portal
Publication:839845
DOI10.1007/S10287-006-0038-4zbMATH Open1187.91193OpenAlexW2075587829MaRDI QIDQ839845FDOQ839845
Authors: S. J. Kane, Michael Bartholomew-Biggs 
Publication date: 3 September 2009
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2299/3644
Recommendations
- Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints
- Threshold accepting approach to improve bound-based approximations for portfolio optimization
- A continuous optimization approach for financial portfolio selection under discrete asset choice constraints
- Portfolio optimization: a mean field theory approach
- Optimal portfolio selection of assets with transaction costs and no short sales
Cites Work
- Stochastic global optimization methods part II: Multi level methods
- The Convergence of a Class of Double-rank Minimization Algorithms
- Lipschitzian optimization without the Lipschitz constant
- Solving mixed integer nonlinear programs by outer approximation
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Stochastic global optimization methods part I: Clustering methods
- MIP: Theory and practice -- closing the gap
- Global optimization approaches to an aircraft routing problem
- A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
- Using global optimization for a microparticle identification problem with noisy data
- Rebalancing an investment portfolio in the presence of convex transaction costs, including market impact costs
Cited In (11)
- Application of a globally convergent hybrid conjugate gradient method in portfolio optimization
- Optimizing preventive maintenance models
- The discrete sell or hold problem with constraints on asset values
- Title not available (Why is that?)
- Complex portfolio selection via convex mixed‐integer quadratic programming: a survey
- A distributed computation algorithm for solving portfolio problems with integer variables
- Extracting from the relaxed for large-scale semi-continuous variable nondominated frontiers
- Solving long-term financial planning problems via global optimization
- Threshold accepting approach to improve bound-based approximations for portfolio optimization
- A convex combination of improved Fletcher-Reeves and Rivaie-Mustafa-Ismail-Leong conjugate gradient methods for unconstrained optimization problems and applications
- Twenty years of linear programming based portfolio optimization
Uses Software
This page was built for publication: A global optimization problem in portfolio selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839845)
