A regularized Newton method for degenerate unconstrained optimization problems
From MaRDI portal
Recommendations
- A regularized Newton method for equality constrained nonconvex optimization
- An inexact proximal regularization method for unconstrained optimization
- Regularized Newton methods for convex minimization problems with singular solutions
- A regularized Newton method without line search for unconstrained optimization
- A new regularized quasi-Newton method for unconstrained optimization
Cites work
- scientific article; zbMATH DE number 1694914 (Why is no real title available?)
- scientific article; zbMATH DE number 1998925 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization
- A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods
- Accurate Symmetric Indefinite Linear Equation Solvers
- CUTE
- Combining and scaling descent and negative curvature directions
- Computing a nearest symmetric positive semidefinite matrix
- Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- Convergence rate of the trust region method for nonlinear equations under local error bound condition
- 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
- Regularized Newton methods for convex minimization problems with singular solutions
- Superlinear convergence of a Newton-type algorithm for monotone equations
Cited in
(18)- Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions
- 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
- A regularization Newton method for mixed complementarity problems
- Regularized Newton methods for convex minimization problems with singular solutions
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
- A regularized factorization-free method for equality-constrained optimization
- Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
- A regularized Newton method for equality constrained nonconvex optimization
- A multi-step class of iterative methods for nonlinear systems
- Correction of trust region method with a new modified Newton method
- A regularized Newton method for monotone nonlinear equations and its application
- A fast and simple modification of Newton's method avoiding saddle points
- Combined methods for solving degenerate unconstrained optimization problems
- On the final steps of Newton and higher order methods
- Two nonmonotone trust region algorithms based on an improved Newton method
- An inexact proximal regularization method for unconstrained optimization
This page was built for publication: A regularized Newton method for degenerate unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1926636)
