Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 58 min ago
PreprintCC BY 4.0arXiv

The Efficient Frontier from a LASSO Solver

Abstract

Schmelzer and Hastie prove that Markowitz's Critical Line Algorithm and the LASSO path trace the same curve. This companion note checks that result numerically with a stock LASSO solver, \texttt{lars\_path} from \texttt{scikit-learn}, and no portfolio software. It covers long--short portfolios under a leverage cap, fixed leverage with varying risk appetite, and the classical long-only, fully invested frontier. Every corner the path returns meets its own optimality conditions to about 10−13 and agrees with independent quadratic-programming solvers, on factor models of up to 500 assets, on the Fama--French size and book-to-market portfolios, and on daily returns of 494 S\&P~500 stocks. Called naively, the long-only path stops at the maximum-Sharpe portfolio. One shift of the response, by an amount computed in advance, lets a single call reach the minimum-variance portfolio. The script, its checks, the Fama--French returns and an R cross-check are published, with a locked environment, so that anyone can repeat them.

Related

  1. Square-Root Clustered Lasso for High-Dimensional Linear Regression with Finite-Sample Theory and Efficient Algorithm Implementation
    Shuqi Wang, Yunhai Xiao, Mengjiao Shi
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. DeHNSSo-v2: A compressible, curvilinear, and efficient extension of the Delft Harmonic Navier-Stokes Solver
    Pietro Carlo Boldini, Yifu Chen, Marios Kotsonis
    arXivPreprintCC BY 4.0Full textMathematical physicsComputational physicsarXiv
  3. An adaptive current–voltage step size solver for accurate and efficient modeling of solar photovoltaic modules
    Nsulwa John Mlazi, Baraka Kichonge
    PLOS OnePeer-reviewedCC BY 4.0Full textGeneral mathematicsPLOS
  4. PrecPack: An Efficient Open-Source Exact Solver for Bin Packing with Generalized Precedence Constraints
    Sunkanghong Wang, Zhengzhong Ricky You, Roberto Baldacci +4
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsOptimisation & controlarXiv
  5. Sharp convergence rate of the estimation error of LASSO via the Feature Space Decomposition method
    Guillaume Lecué, Zong Shang
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{schmelzer2026efficient,
  title = {{The Efficient Frontier from a LASSO Solver}},
  author = {Thomas Schmelzer},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2609.37108},
  eprint = {2609.37108},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.37108},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - The Efficient Frontier from a LASSO Solver
AU  - Thomas Schmelzer
PY  - 2026
DA  - 2026/10/14
PB  - arXiv
DO  - 10.48550/arxiv.2609.37108
UR  - https://arxiv.org/abs/2609.37108
AB  - Schmelzer and Hastie prove that Markowitz's Critical Line Algorithm and the LASSO path trace the same curve. This companion note checks that result numerically with a stock LASSO solver, \texttt{lars\_path} from \texttt{scikit-learn}, and no portfolio software. It covers long--short portfolios under a leverage cap, fixed leverage with varying risk appetite, and the classical long-only, fully invested frontier. Every corner the path returns meets its own optimality conditions to about 10^−13 and agrees with independent quadratic-programming solvers, on factor models of up to 500 assets, on the Fama--French size and book-to-market portfolios, and on daily returns of 494 S\&P~500 stocks. Called naively, the long-only path stops at the maximum-Sharpe portfolio. One shift of the response, by an amount computed in advance, lets a single call reach the minimum-variance portfolio. The script, its checks, the Fama--French returns and an R cross-check are published, with a locked environment, so that anyone can repeat them.
ER  -