Approximate Secular Equations for the Cubic Regularization Subproblem

Nov-14-2025, 10:32:20 GMT–Neural Information Processing Systems

The cubic regularization method (CR) is a popular algorithm for unconstrained non-convex optimization. At each iteration, CR solves a cubically regularized quadratic problem, called the cubic regularization subproblem (CRS).

artificial intelligence, eigenvalue, machine learning, (17 more...)

Neural Information Processing Systems

Nov-14-2025, 10:32:20 GMT

Conferences PDF

Add feedback

Country:
- Asia
  - China > Hong Kong (0.05)
  - Middle East > Jordan (0.04)

Genre:
- Research Report > New Finding (0.46)

Technology:
- Information Technology > Artificial Intelligence
  - Machine Learning (0.69)
  - Representation & Reasoning > Optimization (0.46)