arXiv (All)
open access
Third-Order Newton Methods with Semidefinite Programming
We study a third-order Newton method in which each iteration is obtained by minimizing the third-order Taylor expansion of the objective via a semidefinite programming (SDP) subproblem. In contrast to classical Newton methods, which rely on quadratic approximations, our approach leverages higher-ord
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
- A Globally Convergent Third-Order Newton Method via Unified Semidefinite Programming Subproblems#662410
- A Globally Convergent Third-Order Newton Method via Unified Semidefinite Programming Subproblems#661360
- Positive semidefinite and positive semidefinite splitting iteration methods for solving nonsingular positive semidefinite systems#971681
- A parameterized block LU preconditioning for double saddle point problems#1070101
- Gradient Descent on Logistic Regression with Non-Separable Data and Large Step Sizes#821653
Record · ID 999615
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