arXiv (OAI Expanded)
open access
A Globally Convergent Third-Order Newton Method via Unified Semidefinite Programming Subproblems
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
- Third-Order Newton Methods with Semidefinite Programming#999615
- An Efficient Newton Algorithm for Nonnegative Matrix Factorization with the Kullback-Leibler Divergence#370329
- Gradient Regularized Newton Boosting Trees with Global Convergence#151754
- A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints#1122944
Record · ID 661360
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