Subgradient method
id:
subgradient-method-284-12159254
title:
Subgradient method
text:
Subgradient methods are convex optimization methods which use subderivatives. Originally developed by Naum Z. Shor and others in the 1960s and 1970s, subgradient methods are convergent when applied even to a non-differentiable objective function. When the objective function is differentiable, sub-gradient methods for unconstrained problems use the same search direction as the method of steepest descent. Subgradient methods are slower than Newton's method when applied to minimize twice continuous
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Subgradient_method
date created:
date modified:
2024-02-01T17:33:34Z
main entity:
{"identifier":"Q7631150","url":"https://www.wikidata.org/entity/Q7631150"}
image:
fields total:
13
integrity:
13