arXiv (All)
open access
A Simple yet Highly Accurate Prediction-Correction Algorithm for Time-Varying Optimization
This paper proposes a simple yet highly accurate prediction-correction algorithm, SHARP, for unconstrained time-varying optimization problems. Its prediction is based on an extrapolation derived from the Lagrange interpolation of past solutions. Since this extrapolation can be computed without Hessi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Intelligent system for portfolio optimization for novel volatility forecasting using machine learning.#170581
- Adaptive Patching Is Harder Than It Looks For Time-Series Forecasting#1343596
- Repairability of Inexact Solvers in Recursive State Estimation with Machine Learning#1065028
- The Cost-Accuracy Trade-Off In Operator Learning With Neural Networks#1291188
- Machine-learning in optimization of CRISPR technology.#1068729
Record · ID 1217270
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive