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

DOI10.1134/S0005117919010090zbMATH Open1434.90139OpenAlexW2926844976WikidataQ128104591 ScholiaQ128104591MaRDI QIDQ2287166FDOQ2287166

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

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)

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 (5)

• On the relaxation of some classes of dirichlet minimum problems
• Machine learning algorithms of relaxation subgradient method with space extension
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)