File tree Expand file tree Collapse file tree 1 file changed +4
-4
lines changed Expand file tree Collapse file tree 1 file changed +4
-4
lines changed Original file line number Diff line number Diff line change 1212#
1313# Defining the proximal mapping for a custom function type requires adding a method for [`ProximalCore.prox!`](@ref).
1414#
15- # To compute gradients, algorithms use [`ProximalAlgorithms. value_and_gradient_closure`](@ref):
15+ # To compute gradients, algorithms use [`value_and_gradient_closure`](@ref):
1616# this relies on [AbstractDifferentiation](https://github.com/JuliaDiff/AbstractDifferentiation.jl), for automatic differentiation
17- # with any of its supported backends, when functions are wrapped in [`ProximalAlgorithms. AutoDifferentiable`](@ref),
17+ # with any of its supported backends, when functions are wrapped in [`AutoDifferentiable`](@ref),
1818# as the examples below show.
1919#
2020# If however you would like to provide your own gradient implementation (e.g. for efficiency reasons),
21- # you can simply implement a method for [`ProximalAlgorithms. value_and_gradient_closure`](@ref) on your own function type.
21+ # you can simply implement a method for [`value_and_gradient_closure`](@ref) on your own function type.
2222#
2323# ```@docs
2424# ProximalCore.prox
105105
106106Counting (f:: T ) where {T} = Counting {T} (f, 0 , 0 , 0 )
107107
108- # Now we only need to intercept any call to `value_and_gradient_closure` and `prox!` and increase counters there:
108+ # Now we only need to intercept any call to [ `value_and_gradient_closure`](@ref) and [ `prox!`](@ref) and increase counters there:
109109
110110function ProximalAlgorithms. value_and_gradient_closure (f:: Counting , x)
111111 f. eval_count += 1
You can’t perform that action at this time.
0 commit comments