The FA–SAA Algorithm for CVaR Optimization

This paper develops a unified algorithm to address the Conditional Value at Risk (CVaR) optimization problem characterized by two levels of expectations, where the inner-level expectation handles the repricing of the financial instruments and the outer-level expectation represents the risk measure. We propose an FA–SAA algorithm that tackles the inner-level expectation through function approximation (FA) method and addresses the outer-level expectation by sample average approximation (SAA). A variety of machine learning methods can be incorporated into this algorithm and eventually the optimization problem is reformulated into a linear programming problem, whose optimal value and optimal solution converge to the actual ones. Besides, we demonstrate that the convergence rate of optimal value can achieve [Formula: see text]. The numerical results substantiate the efficacy of our proposed algorithm.

Authors

Institutions

Publication Details

Journal
Asia Pacific Journal of Operational Research
Published
2025-02-03
DOI
https://doi.org/10.1142/s0217595925400020
Citations
1
Primary Topic
Fault Detection and Control Systems
Type
article
Field-Weighted Citation Impact
1.21
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The FA–SAA Algorithm for CVaR Optimization

Ning Lin, L. Jeff Hong
1 citations
Asia Pacific Journal of Operational Research
Fault Detection and Control Systems
1.21
article

The FA–SAA Algorithm for CVaR Optimization

Ning Lin, L. Jeff Hong
article en
1 citations

Abstract

This paper develops a unified algorithm to address the Conditional Value at Risk (CVaR) optimization problem characterized by two levels of expectations, where the inner-level expectation handles the repricing of the financial instruments and the outer-level expectation represents the risk measure. We propose an FA–SAA algorithm that tackles the inner-level expectation through function approximation (FA) method and addresses the outer-level expectation by sample average approximation (SAA). A variety of machine learning methods can be incorporated into this algorithm and eventually the optimization problem is reformulated into a linear programming problem, whose optimal value and optimal solution converge to the actual ones. Besides, we demonstrate that the convergence rate of optimal value can achieve [Formula: see text]. The numerical results substantiate the efficacy of our proposed algorithm.

Asia Pacific Journal of Operational ResearchVol. 42(06)
University of Minnesota (US), Fudan University (CN)
Openalex Percentile: Top 25%
Fault Detection and Control Systems
1.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.