Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions
From MaRDI portal
Publication:2256241
Recommendations
Cites work
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 3233290 (Why is no real title available?)
- scientific article; zbMATH DE number 3388498 (Why is no real title available?)
- A new nonmonotone line search technique for unconstrained optimization
- A non-monotone line search algorithm for unconstrained optimization
- Convergence Conditions for Ascent Methods
- Minimization of functions having Lipschitz continuous first partial derivatives
- Multicriteria optimization with a multiobjective golden section line search
- New inexact line search method for unconstrained optimization
- Nonlinear Programming
- On Steepest Descent
- Sequential Minimax Search for a Maximum
Cited in
(4)- A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
- A multi-layer line search method to improve the initialization of optimization algorithms
- Modelling and optimization applied to the design of fast hydrodynamic focusing microfluidic mixer for protein folding
- scientific article; zbMATH DE number 1728407 (Why is no real title available?)
This page was built for publication: Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256241)