Exploiting negative curvature directions in linesearch methods for unconstrained optimization
From MaRDI portal
Publication:4521380
Recommendations
- Nonconvex optimization using negative curvature within a modified linesearch
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
- scientific article; zbMATH DE number 764401
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- Iterative computation of negative curvature directions in large scale optimization
Cited in
(34)- Improving directions of negative curvature in an efficient manner
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
- Using negative curvature in solving nonlinear programs
- Conjugate direction methods and polarity for quadratic hypersurfaces
- Optimal quotients for solving large eigenvalue problems
- A likelihood-based boosting algorithm for factor analysis models with binary data
- Finding second-order stationary points in constrained minimization: a feasible direction approach
- Iterative grossone-based computation of negative curvature directions in large-scale optimization
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
- A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
- A framework of conjugate direction methods for symmetric linear systems in optimization
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- Exploiting negative curvature in deterministic and stochastic optimization
- Iterative computation of negative curvature directions in large scale optimization
- Nonconvex optimization using negative curvature within a modified linesearch
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- A curvilinear search algorithm for unconstrained optimization by automatic differentiation
- A second-order globally convergent direct-search method and its worst-case complexity
- A symmetric rank-one quasi-Newton line-search method using negative curvature directions
- Adaptive quadratically regularized Newton method for Riemannian optimization
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks
- scientific article; zbMATH DE number 764401 (Why is no real title available?)
- The higher-order Levenberg-Marquardt method with Armijo type line search for nonlinear equations
- Combining and scaling descent and negative curvature directions
- A dwindling filter line search method for unconstrained optimization
- Adaptive nonmonotone line search method for unconstrained optimization
- Complexity guarantees for nonconvex Newton-MR under inexact Hessian information
- Yet another fast variant of Newton's method for nonconvex optimization
- Exploiting effective negative curvature directions via SYMMBK algorithm, in Newton-Krylov methods
- A curvilinear method based on minimal-memory BFGS updates
- Efficient globalization of heavy-ball type methods for unconstrained optimization based on curve searches
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
This page was built for publication: Exploiting negative curvature directions in linesearch methods for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4521380)
