Convergence analysis of a regularized Newton method with generalized regularization terms for convex optimization problems

Documenti analoghi

• Augmented Lagrangian methods for convex optimization with priority constraints via an infeasibility control framework
  di: Yamakawa, Yuya, et al.
  Pubblicazione: (2026)
• A strong second-order sequential optimality condition for nonlinear programming problems
  di: Li, Huimin, et al.
  Pubblicazione: (2025)
• Local convergence analysis of stabilized sequential quadratic programming methods for optimization problems in Banach spaces
  di: Yamakawa, Yuya
  Pubblicazione: (2025)
• Theoretical analysis of the randomized subspace regularized Newton method for non-convex optimization
  di: Fuji, Terunari, et al.
  Pubblicazione: (2022)
• Convergence rates of regularized quasi-Newton methods without strong convexity
  di: Wang, Shida, et al.
  Pubblicazione: (2025)