OpenAlex ·
A splitting proximal method in portfolio optimization with entropic value-at-risk
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.14364
- Original
- Read it at the publisher
- Topics
Abstract
Motivated by a recent paper where a convex portfolio optimization problem formulated by means of the entropic value-at-risk is solved via a primal-dual interior-point method, we propose an alternative way of dealing with such problems by means of splitting proximal point methods and making use of Lagrange duality. Numerical experiments where the new method is implemented for solving some portfolio optimization problems are presented as well. As byproducts, we also provide formulae for the projection on the epigraph of the weighted Shannon entropy, and the conjugate function and subdifferential of entropic value-at-risk.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
Block encoding of semiseparable matrices via their generators
A Counterexample to Three Conjectures of Luo
Sustainable Cloud-Fog-Edge Systems for Smart Buildings: Algorithmic Adaptation under Memory Constraints and Dynamic Orchestration Strategies
CLNO: Conservative Local Neural Operator for Compressible Flow Prediction
Constrained Probabilistic Numerics: Gaussian Process Solvers for Linear PDEs under Linear Inequality Constraints
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.