On the rate of convergence of the minimization method along vectors in a given directional system

DOI10.1016/S0041-5553(83)80028-7zbMATH Open0538.65037MaRDI QIDQ3324939FDOQ3324939

Vladimir N. Krutikov

Publication date: 1983

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

rate of convergencegradient methoditerative process

Mathematics Subject Classification ID

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

Cited In (2)

• A minimization of the maximum function for strongly convex functions with constant step
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• The rate of convergence of the method of steepest descent in the constrained minimization problem 👍 👎
• Convergence of Minimal Sets in Convex Vector Optimization 👍 👎
• ESTIMATES OF THE RATE OF CONVERGENCE FOR CERTAIN MINIMIZATION ALGORITHMS FOR STRONGLY CONVEX FUNCTIONS 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On Convergence of Minmod-Type Schemes 👍 👎

This page was built for publication: On the rate of convergence of the minimization method along vectors in a given directional system

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