Curved search methods for unconstrained optimization

DOI10.1080/02331939008843594zbMath0722.90071OpenAlexW2055782212MaRDI QIDQ3211127

Aharon Ben-Tal, Jochem Zowe, Aaron Melman

Publication date: 1990

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939008843594

zbMATH Keywords

unconstrained optimizationglobal convergenceiterationNewton methodquadratic convergence ratequadratic curvesecond order Taylor expansioncurved search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mathematical programming (90C99)

Related Items (9)

Linear programming with entropic perturbation ⋮ A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem ⋮ Implementation of an inexact approach to solving linear semi-infinite programming problems ⋮ Smoothed penalty algorithms for optimization of nonlinear models ⋮ An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints ⋮ An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions ⋮ An unconstrained convex programming approach to solving convex quadratic programming problems ⋮ A hybrid-line-and-curve search globalization technique for inexact Newton methods ⋮ A variant of curved search method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Second-order and related extremality conditions in nonlinear programming
• Technical note: Directional derivatives in nonsmooth optimization
• Curvilinear path steplength algorithms for minimization which use directions of negative curvature
• A modification of Armijo's step-size rule for negative curvature
• On the use of directions of negative curvature in a modified newton method

This page was built for publication: Curved search methods for unconstrained optimization