Descent: an optimization point of view on different fields

DOI10.1016/J.EJOR.2006.06.008zbMATH Open1121.90101OpenAlexW2044179976MaRDI QIDQ872231FDOQ872231

Authors: J. Brinkhuis 

Publication date: 27 March 2007

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

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

Recommendations

• Foundations of Optimization
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions
• Curves of descent
• Convergence properties of descent methods for unconstrained minization
• Convergence theorems for continuous descent methods

zbMATH Keywords

continuous optimizationnonlinear programmingconvex programmingfundamental theorem of algebranecessary conditions of optimalityKarush-Kuhn-Tucker

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Descent: an optimization point of view on different fields

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