Combining search directions using gradient flows
From MaRDI portal
Publication:1404235
DOI10.1007/s10107-002-0367-1zbMath1049.90126OpenAlexW1984003452MaRDI QIDQ1404235
Javier M. Moguerza, Francisco Javier Prieto
Publication date: 20 August 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10016/14909
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Interior-point methods (90C51)
Related Items (8)
Convergence of line search methods for unconstrained optimization ⋮ A note on the use of vector barrier parameters for interior-point methods ⋮ Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems ⋮ Nonconvex optimization using negative curvature within a modified linesearch ⋮ Combining and scaling descent and negative curvature directions ⋮ A new class of memory gradient methods with inexact line searches ⋮ A trajectory-based method for constrained nonlinear optimization problems ⋮ Improving directions of negative curvature in an efficient manner
Uses Software
This page was built for publication: Combining search directions using gradient flows
