Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
From MaRDI portal
Publication:2393069
DOI10.1007/s10898-012-9842-2zbMath1275.90044OpenAlexW2036699147MaRDI QIDQ2393069
Xueting Cui, Xiaoling Sun, Xiao Jin Zheng, Shu-Shang Zhu
Publication date: 7 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9842-2
portfolio selectionsemidefinite programcardinality constraintsecond-order cone programmixed 0-1 QCQP reformulation
Related Items
Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection, Multiperiod mean absolute deviation fuzzy portfolio selection model with risk control and cardinality constraints, Global optimization for sparse solution of least squares problems, An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems, A Scalable Algorithm for Sparse Portfolio Selection, Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach, Recent advances in mathematical programming with semi-continuous variables and cardinality constraint, Quadratic Convex Reformulations for Semicontinuous Quadratic Programming, Multi-period possibilistic mean semivariance portfolio selection with cardinality constraints and its algorithm, Sparse and risk diversification portfolio selection, Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs, Cardinality constrained portfolio selection problem: a completely positive programming approach, Quadratic optimization over a second-order cone with linear equality constraints, Time-consistent multiperiod mean semivariance portfolio selection with the real constraints, A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, Global optimization algorithm for mixed integer quadratically constrained quadratic program, Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint, Uncertain mean-variance model for dynamic project portfolio selection problem with divisibility, Fast algorithms for sparse portfolio selection considering industries and investment styles, Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming, Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach, Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems, Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach, An augmented Lagrangian proximal alternating method for sparse discrete optimization problems, Chance-constrained multiperiod mean absolute deviation uncertain portfolio selection, Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables, Multiperiod mean absolute deviation uncertain portfolio selection with real constraints, Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs, A penalty PALM method for sparse portfolio selection problems, Approximated perspective relaxations: a project and lift approach
Uses Software
Cites Work
- A note on the dynamic liquidity trading problem with a mean-variance objective
- Financial engineering, E-commerce and supply chain
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Algorithm for cardinality-constrained quadratic optimization
- Statistical analysis of financial networks
- Topics in semidefinite and interior-point methods
- Continuous-time mean-variance portfolio selection: a stochastic LQ framework
- Computational study of a family of mixed-integer quadratic programming problems
- On the use of optimization models for portfolio selection: A review and some computational results
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Mining market data: a network approach
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Optimal Dynamic Portfolio Selection: Multiperiod Mean-Variance Formulation
- Lectures on Modern Convex Optimization
- A Minimax Portfolio Selection Rule with Linear Programming Solution
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
- Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
- Semidefinite Programming
