The non-monotone conic algorithm

DOI10.1080/02522667.2008.10699787zbMATH Open1181.90247OpenAlexW2083289822MaRDI QIDQ3598646FDOQ3598646

Authors: G. E. Manoussakis, C. A. Botsaris, 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

Recommendations

• scientific article; zbMATH DE number 2130407
• A FAST conic method for function minimization
• Algorithms with Conic Termination for Nonlinear Optimization
• scientific article; zbMATH DE number 2130404
• A nonmonotone line search method based on a simple conic model function

zbMATH Keywords

unconstrained optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Testing Unconstrained Optimization Software
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• Title not available (Why is that?)
• A Nonmonotone Line Search Technique for Newton’s Method
• Minimization of functions having Lipschitz continuous first partial derivatives
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new unconstrained optimization method for imprecise function and gradient values
• A new conic method for unconstrained minimization

Cited In (2)

• Non monotone algorithms for unconstrained minimization: upper bounds on function values
• A nonmonotone line search method based on a simple conic model function

This page was built for publication: The non-monotone conic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3598646)