Truncated regularized Newton method for convex minimizations
From MaRDI portal
Recommendations
- Regularized Newton methods for convex minimization problems with singular solutions
- On the convergence of a modified regularized Newton method for convex optimization with singular solutions
- Efficient regularized Newton-type algorithm for solving convex optimization problem
- A regularized Newton method for equality constrained nonconvex optimization
- Regularized Newton method for unconstrained convex optimization
Cites work
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- A survey of truncated-Newton methods
- A truncated nonmonotone Gauss-Newton method for large-scale nonlinear least-squares problems
- Assessing a search direction within a truncated Newton method
- Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
- scientific article; zbMATH DE number 1694914 (Why is no real title available?)
- scientific article; zbMATH DE number 3901928 (Why is no real title available?)
- scientific article; zbMATH DE number 1306984 (Why is no real title available?)
- Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- On the convergence of an inexact Newton-type method
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- Regularized Newton methods for convex minimization problems with singular solutions
- Superlinear convergence of a Newton-type algorithm for monotone equations
- Truncated-Newton algorithms for large-scale unconstrained optimization
Cited in
(18)- On the truncated conjugate gradient method
- A new regularized quasi-Newton method for unconstrained optimization
- Regularized Newton methods for convex minimization problems with singular solutions
- On the convergence of a modified regularized Newton method for convex optimization with singular solutions
- Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
- Efficient regularized Newton-type algorithm for solving convex optimization problem
- scientific article; zbMATH DE number 5800584 (Why is no real title available?)
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- scientific article; zbMATH DE number 5616 (Why is no real title available?)
- An inexact proximal regularization method for unconstrained optimization
- scientific article; zbMATH DE number 6253875 (Why is no real title available?)
- Newton-MR: inexact Newton method with minimum residual sub-problem solver
- Correction of nonmonotone trust region algorithm based on a modified diagonal regularized quasi-Newton method
- Least H^2 norm updating of quadratic interpolation models for derivative-free trust-region algorithms
- Derivative-free optimization with transformed objective functions and the algorithm based on the least Frobenius norm updating quadratic model
- Convergence analysis of a regularized Newton method with generalized regularization terms for unconstrained convex optimization problems
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- A regularized Newton method without line search for unconstrained optimization
This page was built for publication: Truncated regularized Newton method for convex minimizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q842780)
