Curved search methods for unconstrained optimization

DOI10.1080/02331939008843594MaRDI QIDQ3211127zbMATH OpenOpenAlexFDO

Authors Aharon Ben-Tal, J. 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

curved searchglobal convergenceiterationNewton methodquadratic convergence ratequadratic curvesecond order Taylor expansionunconstrained optimization

Mathematics Subject Classification ID

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

Recommendations

• A variant of curved search method
• A multi-step curve search algorithm in nonlinear optimization
• scientific article; zbMATH DE number 269558
• A new descent algorithm with curve search rule
• A Curvilinear Search Using Tridiagonal Secant Updates for Unconstrained Optimization

Cites work

• A modification of Armijo's step-size rule for negative curvature
• Curvilinear path steplength algorithms for minimization which use directions of negative curvature
• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 3687182 (Why is no real title available?)
• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• On the use of directions of negative curvature in a modified newton method
• Second-order and related extremality conditions in nonlinear programming
• Technical note: Directional derivatives in nonsmooth optimization

Cited in

(22)

• A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem
• Frame-based ray search algorithms in unconstrained optimization
• Line search by curve fitting in minimization algorithms
• Implementation of an inexact approach to solving linear semi-infinite programming problems
• An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints
• A hybrid-line-and-curve search globalization technique for inexact Newton methods
• A generating set search method using curvature information
• Smoothed penalty algorithms for optimization of nonlinear models
• A multi-step curve search algorithm in nonlinear optimization
• Method of minimization with the aid of curvilinear descent
• scientific article; zbMATH DE number 4037623 (Why is no real title available?)
• An unconstrained convex programming approach to solving convex quadratic programming problems
• scientific article; zbMATH DE number 38133 (Why is no real title available?)
• scientific article; zbMATH DE number 611142 (Why is no real title available?)
• Convergence of multi-step curve search method for unconstrained optimization
• A variant of curved search method
• scientific article; zbMATH DE number 800270 (Why is no real title available?)
• An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions
• scientific article; zbMATH DE number 883223 (Why is no real title available?)
• Linear programming with entropic perturbation
• Global line search strategies for nonlinear least squares problems based on curvature and projected curvature
• Efficient globalization of heavy-ball type methods for unconstrained optimization based on curve searches

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3211127)