Nonconvex optimization using negative curvature within a modified linesearch
From MaRDI portal
Publication:2482748
DOI10.1016/j.ejor.2006.09.097zbMath1146.90054OpenAlexW2063311145MaRDI QIDQ2482748
Alberto Olivares, Javier M. Moguerza, Francisco Javier Prieto
Publication date: 24 April 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10016/14891
Related Items (10)
Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems ⋮ Combining and scaling descent and negative curvature directions ⋮ A curvilinear method based on minimal-memory BFGS updates ⋮ A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds ⋮ A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization ⋮ 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 ⋮ Improving directions of negative curvature in an efficient manner ⋮ A likelihood-based boosting algorithm for factor analysis models with binary data ⋮ The higher-order Levenberg–Marquardt method with Armijo type line search for nonlinear equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quadratic cost flow and the conjugate gradient method
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- A modified Newton method for minimization
- A second-order method for the general nonlinear programming problem
- A generalized conjugate gradient algorithm
- A trust region algorithm for nonsmooth optimization
- An augmented Lagrangian interior-point method using directions of negative curvature
- Combining search directions using gradient flows
- Minimization of functions having Lipschitz continuous first partial derivatives
- Curvilinear path steplength algorithms for minimization which use directions of negative curvature
- Penalty methods for computing points that satisfy second order necessary conditions
- Newton-type methods for unconstrained and linearly constrained optimization
- A modification of Armijo's step-size rule for negative curvature
- On the use of directions of negative curvature in a modified newton method
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- CUTE
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- Sequential Quadratic Programming with Penalization of the Displacement
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
This page was built for publication: Nonconvex optimization using negative curvature within a modified linesearch
