On the properties of the method of minimization for convex functions with relaxation on the distance to extremum
From MaRDI portal
Publication:2287166
DOI10.1134/S0005117919010090zbMATH Open1434.90139OpenAlexW2926844976WikidataQ128104591 ScholiaQ128104591MaRDI QIDQ2287166FDOQ2287166
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
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
- Smooth minimization of non-smooth functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Subgradient methods for huge-scale optimization problems
- Universal gradient methods for convex optimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Note on a method of conjugate subgradients for minimizing nondifferentiable functions
- Method of conjugate subgradients with constrained memory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
Uses Software
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)
