A Curvilinear Search Using Tridiagonal Secant Updates for Unconstrained Optimization
From MaRDI portal
Recommendations
Cited in
(13)- On the convergence of curvilinear search algorithms in unconstrained optimization
- Line search by curve fitting in minimization algorithms
- An interior method for nonconvex semidefinite programs
- A two-step accelerated Levenberg-Marquardt method for solving multilinear systems in tensor-train format
- Calibration by optimization without using derivatives
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
- A curvilinear search algorithm for unconstrained optimization by automatic differentiation
- Curved search methods for unconstrained optimization
- scientific article; zbMATH DE number 3960893 (Why is no real title available?)
- scientific article; zbMATH DE number 611142 (Why is no real title available?)
- scientific article; zbMATH DE number 269558 (Why is no real title available?)
- A curvilinear method based on minimal-memory BFGS updates
- An augmented filled function for global nonlinear integer optimization
This page was built for publication: A Curvilinear Search Using Tridiagonal Secant Updates for Unconstrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012414)