• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    迪恩网络公众号

JuliaFirstOrder/ProximalOperators.jl: Proximal operators for nonsmooth optimizat ...

原作者: [db:作者] 来自: 网络 收藏 邀请

开源软件名称:

JuliaFirstOrder/ProximalOperators.jl

开源软件地址:

https://github.com/JuliaFirstOrder/ProximalOperators.jl

开源编程语言:

Julia 99.0%

开源软件介绍:

ProximalOperators.jl

Build status codecov DOI

Proximal operators for nonsmooth optimization in Julia. This package can be used to easily implement proximal algorithms for convex and nonconvex optimization problems such as ADMM, the alternating direction method of multipliers.

See ProximalAlgorithms.jl for generic implementations of algorithms based on the primitives here defined.

See the documentation on how to use the package.

Installation

To install the package, hit ] from the Julia command line to enter the package manager, then

pkg> add ProximalOperators

Usage

With using ProximalOperators the package exports the prox and prox! methods to evaluate the proximal mapping of several functions.

A list of available function constructors is in the documentation.

For example, you can create the L1-norm as follows.

julia> f = NormL1(3.5)
description : weighted L1 norm
type        : Array{Complex} → Real
expression  : x ↦ λ||x||_1
parameters  : λ = 3.5

Functions created this way are, of course, callable.

julia> x = randn(10) # some random point
julia> f(x)
32.40700818735099

prox evaluates the proximal operator associated with a function, given a point and (optionally) a positive stepsize parameter, returning the proximal point y and the value of the function at y:

julia> y, fy = prox(f, x, 0.5) # last argument is 1.0 if absent

prox! evaluates the proximal operator in place, and only returns the function value at the proximal point:

julia> fy = prox!(y, f, x, 0.5) # in-place equivalent to y, fy = prox(f, x, 0.5)

Related packages

References

  1. N. Parikh and S. Boyd (2014), Proximal Algorithms, Foundations and Trends in Optimization, vol. 1, no. 3, pp. 127-239.

  2. S. Boyd, N. Parikh, E. Chu, B. Peleato and J. Eckstein (2011), Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers, Foundations and Trends in Machine Learning, vol. 3, no. 1, pp. 1-122.

Credits

ProximalOperators.jl is developed by Lorenzo Stella and Niccolò Antonello at KU Leuven, ESAT/Stadius, and Mattias Fält at Lunds Universitet, Department of Automatic Control.




鲜花

握手

雷人

路过

鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
热门推荐
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服(服务时间 9:00~18:00)

在线QQ客服
地址:深圳市南山区西丽大学城创智工业园
电邮:jeky_zhao#qq.com
移动电话:139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap