Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions
From MaRDI portal
Publication:2256241
DOI10.1016/J.EJOR.2013.12.041zbMATH Open1305.90338OpenAlexW2139361985MaRDI QIDQ2256241FDOQ2256241
Authors: 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
Recommendations
Cites Work
- Convergence Conditions for Ascent Methods
- Minimization of functions having Lipschitz continuous first partial derivatives
- Title not available (Why is that?)
- Nonlinear Programming
- On Steepest Descent
- Title not available (Why is that?)
- A non-monotone line search algorithm for unconstrained optimization
- New inexact line search method for unconstrained optimization
- A new nonmonotone line search technique for unconstrained optimization
- Sequential Minimax Search for a Maximum
- Multicriteria optimization with a multiobjective golden section line search
- Title not available (Why is that?)
Cited In (4)
- 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
- Title not available (Why is that?)
- Modelling and optimization applied to the design of fast hydrodynamic focusing microfluidic mixer for protein folding
Uses Software
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)