Truncated regularized Newton method for convex minimizations
From MaRDI portal
Publication:842780
DOI10.1007/S10589-007-9128-7zbMATH Open1176.90461OpenAlexW2102853500MaRDI QIDQ842780FDOQ842780
Authors: Ying-Jie Li, Dong-Hui Li
Publication date: 25 September 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9128-7
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
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- A truncated nonmonotone Gauss-Newton method for large-scale nonlinear least-squares problems
- Title not available (Why is that?)
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Superlinear convergence of a Newton-type algorithm for monotone equations
- Title not available (Why is that?)
- Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
- A survey of truncated-Newton methods
- Assessing a search direction within a truncated Newton method
- Regularized Newton methods for convex minimization problems with singular solutions
- On the convergence of an inexact Newton-type method
- Title not available (Why is that?)
Cited In (15)
- Title not available (Why is that?)
- A regularized Newton method without line search for unconstrained optimization
- A new regularized quasi-Newton method for unconstrained optimization
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- Regularized Newton methods for convex minimization problems with singular solutions
- Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
- Correction of nonmonotone trust region algorithm based on a modified diagonal regularized quasi-Newton method
- Title not available (Why is that?)
- Newton-MR: inexact Newton method with minimum residual sub-problem solver
- Efficient regularized Newton-type algorithm for solving convex optimization problem
- On the convergence of a modified regularized Newton method for convex optimization with singular solutions
- On the truncated conjugate gradient method
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- Title not available (Why is that?)
- An inexact proximal regularization method for unconstrained optimization
Uses Software
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)