Calhoun
metadata only
A nontangential cutting plane algorithm
The cutting plane algorithm typically generates cuts that are tangential, or nearly so, to the Lagrangian dual function of the underlying optimization problem. This paper demonstrates that the algorithm still converges to an optimal solution when cuts are nontangential. These cuts are generated by n
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
- Global Linear Convergence of the Proximal Bundle Method under Unknown Piecewise Smoothness and Quadratic Growth#999009
- Lipschitz-inspired HALRECT Algorithm for Derivative-free Global Optimization#986063
- Multilevel Regularized Newton Methods with Fast Convergence Rates#1217243
- Block-coordinate Plug-And-Play Methods with Armijo-like line-search for Image Restoration#974341
- Difference-of-Convex Regularization for Graph Learning by Differentiable Programming#1201036
Record · ID 1227758
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