Research map / Optimization / Nonconvex and smooth optimization
A Linearly Convergent Proximal Subgradient Algorithm for Sparse Portfolio Optimization with Transaction Cost
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization (NeurIPS 2024 · similarity 0.88)
- Autonomous Sparse Mean-CVaR Portfolio Optimization (ICML 2024 · similarity 0.88)
- Data-Dependent Bounds for Online Portfolio Selection Without Lipschitzness and Smoothness (NeurIPS 2023 · similarity 0.87)
- Decision-focused Sparse Tangent Portfolio Optimization (ICML 2026 · similarity 0.87)
- Online Min-Max Optimization: From Individual Regrets to Cumulative Saddle Points (NeurIPS 2026 · similarity 0.86)
- Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search (ICML 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.