arXiv (All)
open access
Splitting Methods for Nonconvex Optimisation: Convergence and Saddle Point Avoidance Through Shadow Sequences
In nonconvex optimisation, commonly used methods are usually shown to converge to stationary points, while guarantees of convergence to local minimisers have comparatively received less attention. To close this gap, we analyse the convergence behaviour of the Davis--Yin three-operator splitting meth
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
- The Geometric Inversion of SHA-256: A Meta-Computational Analysis of the Nexus Framework and Topological State Recovery#176404
- Mixing Makes Markovian Contexts Cheap for Linear Bandits#973089
- Framework for Loop-Free Convergence Using the Ordered Forwarding Information Base (oFIB) Approach#220707
- Visualizing the Phase Space of Two Interacting Spherical Magnets via Lagrangian Descriptors#417729
- The Sheaf Laplacian: A Topological Framework for Data Fusion and Consensus in Distributed Sensing Networks#290556
Record · ID 1142597
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