On a space extension algorithm for nondifferentiable optimization

DOI10.1007/BF00934744MaRDI QIDQ1054275zbMATH OpenFDO

Authors M. Zafer Yakin

Publication date 1984

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

strongly convex functionsnondifferentiable optimizationapproximate line searchrate of convergence analysisspace extension algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Convexity of real functions of several variables, generalizations (26B25) Methods of reduced gradient type (90C52)

Cites work

• scientific article; zbMATH DE number 3791939 (Why is no real title available?)
• scientific article; zbMATH DE number 3559294 (Why is no real title available?)
• scientific article; zbMATH DE number 3568378 (Why is no real title available?)
• scientific article; zbMATH DE number 3577030 (Why is no real title available?)
• scientific article; zbMATH DE number 3606405 (Why is no real title available?)
• scientific article; zbMATH DE number 3619635 (Why is no real title available?)
• scientific article; zbMATH DE number 3272538 (Why is no real title available?)
• scientific article; zbMATH DE number 3323071 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• Convergence rate of the gradient descent method with dilatation of the space
• Convex Analysis
• Exact penalty functions in nonlinear programming
• Finding the nearest point in A polytope
• On convergence rates of subgradient optimization methods

This page was built for publication: On a space extension algorithm for nondifferentiable optimization

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