On the properties of the method of minimization for convex functions with relaxation on the distance to extremum

DOI10.1134/S0005117919010090MaRDI QIDQ2287166zbMATH OpenOpenAlexWikidataFDO

Authors Vladimir N. Krutikov, N. S. Samoilenko, Vladimir V. Meshechkin

Publication date 23 January 2020

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0005117919010090

zbMATH Keywords

convex functionconvergence ratelinear algebrasubgradientminimum of function

Mathematics Subject Classification ID

Convex programming (90C25) Methods of reduced gradient type (90C52)

Recommendations

• Publication:3471857
• Application of the method of conjugate subgradients to minimization of quasiconvex functions
• A minimization of the maximum function for strongly convex functions with constant step
• A non-monotone conjugate subgradient type method for minimization of convex functions
• scientific article; zbMATH DE number 2000794

Cites work

• scientific article; zbMATH DE number 3830713 (Why is no real title available?)
• scientific article; zbMATH DE number 3854298 (Why is no real title available?)
• scientific article; zbMATH DE number 4063877 (Why is no real title available?)
• scientific article; zbMATH DE number 3790207 (Why is no real title available?)
• scientific article; zbMATH DE number 3559294 (Why is no real title available?)
• scientific article; zbMATH DE number 3557512 (Why is no real title available?)
• scientific article; zbMATH DE number 2000794 (Why is no real title available?)
• scientific article; zbMATH DE number 912314 (Why is no real title available?)
• scientific article; zbMATH DE number 7604747 (Why is no real title available?)
• Method of conjugate subgradients with constrained memory
• Note on a method of conjugate subgradients for minimizing nondifferentiable functions
• Smooth minimization of non-smooth functions
• Subgradient methods for huge-scale optimization problems
• Universal gradient methods for convex optimization problems

Cited in

(8)

• Machine learning algorithms of relaxation subgradient method with space extension
• On the relaxation of some classes of dirichlet minimum problems
• About some works of Boris Polyak on convergence of gradient methods and their development
• scientific article; zbMATH DE number 7656028 (Why is no real title available?)
• scientific article; zbMATH DE number 4139498 (Why is no real title available?)
• On the convergence rate of the subgradient method with metric variation and its applications in neural network approximation schemes
• scientific article; zbMATH DE number 4139492 (Why is no real title available?)
• scientific article; zbMATH DE number 2000794 (Why is no real title available?)

Describes a project that uses

Uses Software

• NESUN

This page was built for publication: On the properties of the method of minimization for convex functions with relaxation on the distance to extremum

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