Combined methods for solving degenerate unconstrained optimization problems
From MaRDI portal
Recommendations
- A regularized Newton method for degenerate unconstrained optimization problems
- 2-factor Newton method for solving constrained optimization problems with a degenerate Kuhn-Tucker system
- scientific article; zbMATH DE number 4066235
- Reduced-Hessian quasi-Newton methods for unconstrained optimization
- Tensor Methods for Unconstrained Optimization Using Second Derivatives
Cites work
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- A new hybrid conjugate gradient algorithm for unconstrained optimization
- A new regularized quasi-Newton method for unconstrained optimization
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
- A regularized Newton method for degenerate unconstrained optimization problems
- An efficient improvement of the Newton method for solving nonconvex optimization problems
- Deep learning
- Diagonal approximation of the Hessian by finite differences for unconstrained optimization
- Efficient regularized Newton-type algorithm for solving convex optimization problem
- Generalized inverses: theory and computations
- Higher-order optimality conditions and higher-order tangent sets
- Higher-order optimality conditions for strict local minima
- Methods for solving degenerate problems
- Modern numerical nonlinear optimization
- Searching minima of an N-dimensional surface: A robust valley following method
- The use of quadratic regularization with a cubic descent condition for unconstrained optimization
- Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems
- Using gradient directions to get global convergence of Newton-type methods
This page was built for publication: Combined methods for solving degenerate unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637380)
