The non-monotone conic algorithm
From MaRDI portal
Publication:3598646
DOI10.1080/02522667.2008.10699787zbMath1181.90247OpenAlexW2083289822MaRDI QIDQ3598646
C. A. Botsaris, G. E. Manoussakis, T. N. Grapsa
Publication date: 3 February 2009
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.2008.10699787
Cites Work
- A new conic method for unconstrained minimization
- A new unconstrained optimization method for imprecise function and gradient values
- Minimization of functions having Lipschitz continuous first partial derivatives
- Testing Unconstrained Optimization Software
- A Nonmonotone Line Search Technique for Newton’s Method
- A Rapidly Convergent Descent Method for Minimization
- Function minimization by conjugate gradients
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The non-monotone conic algorithm