Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions

DOI10.1016/J.EJOR.2013.12.041zbMath1305.90338OpenAlexW2139361985MaRDI QIDQ2256241

Douglas Alexandre Gomes Vieira, Adriano Chaves Lisboa

Publication date: 19 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.12.041

zbMATH Keywords

nonlinear programmingline searchbisectiongolden section methodmultimodal functionsbrent's algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (3)

A multi-layer line search method to improve the initialization of optimization algorithms ⋮ A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems ⋮ Modelling and optimization applied to the design of fast hydrodynamic focusing microfluidic mixer for protein folding

Uses Software

• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A non-monotone line search algorithm for unconstrained optimization
• Multicriteria optimization with a multiobjective golden section line search
• New inexact line search method for unconstrained optimization
• Minimization of functions having Lipschitz continuous first partial derivatives
• Nonlinear Programming
• Convergence Conditions for Ascent Methods
• On Steepest Descent
• Sequential Minimax Search for a Maximum
• A new nonmonotone line search technique for unconstrained optimization

This page was built for publication: Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions