A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems
DOI10.3934/jimo.2018189zbMath1449.65127OpenAlexW2906633937WikidataQ128658737 ScholiaQ128658737MaRDI QIDQ781111
Publication date: 16 July 2020
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2018189
calmnessrobust portfolio selectionQ-linear convergencemulti-block convex optimizationsymmetric Gauss-Seidel decomposition
Numerical methods (including Monte Carlo methods) (91G60) Numerical mathematical programming methods (65K05) Convex programming (90C25) Portfolio theory (91G10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination
- PPROJ
- Fast projection onto the simplex and the \(l_1\) ball
- Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- On general minimax theorems
- Convex analysis and nonlinear optimization. Theory and examples.
- Multi-period portfolio optimization with linear control policies
- Multi-stage stochastic linear programs for portfolio optimization
- Mean-risk model for uncertain portfolio selection with background risk
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- Portfolio selection problems with Markowitz's mean-variance framework: a review of literature
- Recent developments in robust portfolios with a worst-case approach
- Portfolio optimization using a new probabilistic risk measure
- Tractable approximations to robust conic optimization problems
- Optimal multi-period mean-variance policy under no-shorting constraint
- Worst-case robust decisions for multi-period mean-variance portfolio optimization
- Projection onto a Polyhedron that Exploits Sparsity
- Optimal Cardinality Constrained Portfolio Selection
- A Proximal Point Algorithm for Log-Determinant Optimization with Group Lasso Regularization
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- Portfolio Selection with Robust Estimation
- Implicit Functions and Solution Mappings
- Some continuity properties of polyhedral multifunctions
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Variational Analysis
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
This page was built for publication: A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems
