Abstract.
The efficient combination of directions is a significant problem in line search methods that either use negative curvature, or wish to include additional information such as the gradient or different approximations to the Newton direction.
In this paper we describe a new procedure to combine several of these directions within an interior-point primal-dual algorithm. Basically, we combine in an efficient manner a modified Newton direction with the gradient of a merit function and a direction of negative curvature, if it exists. We also show that the procedure is well-defined, and it has reasonable theoretical properties regarding the rate of convergence of the method.
We also present numerical results from an implementation of the proposed algorithm on a set of small test problems from the CUTE collection.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: November 2000 / Accepted: October 2002 Published online: February 14, 2003
Key Words. negative curvature – primal-dual methods – interior-point methods – nonconvex optimization – line searches
Mathematics Subject Classification (1991): 49M37, 65K05, 90C30
Rights and permissions
About this article
Cite this article
Moguerza, J., Prieto, F. Combining search directions using gradient flows. Math. Program., Ser. A 96, 529–559 (2003). https://doi.org/10.1007/s10107-002-0367-1
Issue Date:
DOI: https://doi.org/10.1007/s10107-002-0367-1