Nonconvex optimization using negative curvature within a modified linesearch
From MaRDI portal
Publication:2482748
Recommendations
- Using negative curvature in solving nonlinear programs
- A nonmonotone filter curvilinear line search algorithm for unconstrained nonconvex optimization
- scientific article; zbMATH DE number 4087442
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
Cites work
- A generalized conjugate gradient algorithm
- A modification of Armijo's step-size rule for negative curvature
- A modified Newton method for minimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A second-order method for the general nonlinear programming problem
- A trust region algorithm for nonsmooth optimization
- An augmented Lagrangian interior-point method using directions of negative curvature
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Combining search directions using gradient flows
- Curvilinear path steplength algorithms for minimization which use directions of negative curvature
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- CUTE
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- scientific article; zbMATH DE number 3843084 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- Minimization of functions having Lipschitz continuous first partial derivatives
- Newton-type methods for unconstrained and linearly constrained optimization
- On the use of directions of negative curvature in a modified newton method
- Penalty methods for computing points that satisfy second order necessary conditions
- Quadratic cost flow and the conjugate gradient method
- Sequential Quadratic Programming with Penalization of the Displacement
Cited in
(23)- Improving directions of negative curvature in an efficient manner
- An augmented Lagrangian interior-point method using directions of negative curvature
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
- Using negative curvature in solving nonlinear programs
- A likelihood-based boosting algorithm for factor analysis models with binary data
- A comparison of methods for traversing regions of non-convexity in optimization problems
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
- Exploiting negative curvature in deterministic and stochastic optimization
- scientific article; zbMATH DE number 1694901 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 3967814 (Why is no real title available?)
- scientific article; zbMATH DE number 4087442 (Why is no real title available?)
- A primal-dual algorithm for nonlinear programming exploiting negative curvature directions
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- A nonmonotone filter curvilinear line search algorithm for unconstrained nonconvex optimization
- Traversing non-convex regions
- The higher-order Levenberg-Marquardt method with Armijo type line search for nonlinear equations
- Combining and scaling descent and negative curvature directions
- A hybrid inexact regularized Newton and negative curvature method
- Exploiting effective negative curvature directions via SYMMBK algorithm, in Newton-Krylov methods
- A curvilinear method based on minimal-memory BFGS updates
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
This page was built for publication: Nonconvex optimization using negative curvature within a modified linesearch
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482748)
