A cyclic iterative Chebyshev method for unconstrained minimization of functions

DOI10.1515/RNAM.1992.7.3.269zbMATH Open0816.65034OpenAlexW2113717698MaRDI QIDQ4697652FDOQ4697652

Authors: A. Sh. Zhuzhunashvili 

Publication date: 7 May 1995

Published in: Russian Journal of Numerical Analysis and Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/rnam.1992.7.3.269

Recommendations

• scientific article; zbMATH DE number 4099859
• scientific article; zbMATH DE number 2168917
• Methods of unconditional minimization of functions using a simplex
• A new conic method for unconstrained minimization
• scientific article; zbMATH DE number 165426

zbMATH Keywords

convergencestrongly convex functionsunconstrained minimizationvariable-metric methodcyclic iterative Chebyshev methodill-posed function minimization problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: A cyclic iterative Chebyshev method for unconstrained minimization of functions

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