An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity

Những quyển sách tương tự

• Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization.
  Bằng: Cartis, C, et al.
  Được phát hành: (2012)
• On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems.
  Bằng: Cartis, C, et al.
  Được phát hành: (2010)
• Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
  Bằng: Cartis, C, et al.
  Được phát hành: (2020)
• On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization.
  Bằng: Cartis, C, et al.
  Được phát hành: (2012)
• Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
  Bằng: Cartis, C, et al.
  Được phát hành: (2018)