Codes for "Primal–dual proximal splitting and generalized conjugation in non-smooth non-convex optimization"
Lists
Only you see this
Abstract
GPDPS\n\nGPDPS is a Julia package that provides the reference implementation of the generalized primal-dual proximal splitting approach described in the paper "Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization" by Christian Clason, Stanislav Mazurenko, and Tuomo Valkonen.\n\nUsage\n\nTo use the provided test codes (compatible with Julia version 1.0-1.2, tested on macOS and Linux x86_64):\n\n\n\tstart Julia from this directory with julia --project=. (or with the relative path to the GPDPS.jl directory from somewhere else)\n\tdo ]instantiate to download all dependencies (only required the first time, make sure you go back to standard Julia prompt with backspace afterwards)\n\t(highly recommended: using Revise so you can make changes in the code without having to restart Julia; if not install, start julia (without --project) and ]add Revise)\n\tload the package with using GPDPS\n\n\nTo run the example for the elliptic Nash equilibrium problem:\n\n\n\tdo test_enep(N), where N controls the discretization (number of nodes per coordinate, default N=128)\n\n\nTo run the example for the Huber-Potts segmentation model:\n\n\n\t\n\tdo test_potts(alpha,gamma,keyword=value), where keyword is one or more of the following (comma separated, order insensitive, may be removed before submission) with default value if omitted:\n\t\n\t\n\timage: test image; default is "blobs" (size 256x254), other images in .tif format can be specified by file name if placed in the img folder\n\t\n\t\n\tisotropic: use isotropic (value true, default) or anisotropic (value `false)` Potts model\n\t\n\t\n\tmaxit: maximum number of iterations (default 500000)\n\t\n\n\nIf alpha or gamma are not specified, the default values 1 and 1e-3 are used.\n\nPossible issues:\n\n\n\ton macOS, it may also be required to ]add QuartzImageIO if it is not included in the default environment.\n\n\nDevelopment\n\nThis code can also be found at https://github.com/clason/GPDPS.jl\n\nReference\n\nIf you find this code useful, you can cite the paper as\n\n@article{GPDPS,\n author = {Clason, Christian and Mazurenko, Stanislav and Valkonen, Tuomo},\n title = {Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization},\n year = {2019},\n eprinttype = {arxiv},\n eprint = {1901.02746},\n}\n
BibTeX
@inproceedings{clason2020codes,
author = {Christian Clason and Stanislav Mazurenko and Tuomo Valkonen},
title = {{Codes for "Primal–dual proximal splitting and generalized conjugation in non-smooth non-convex optimization"}},
booktitle = {Zenodo},
year = {2020},
doi = {10.5281/zenodo.3647615},
}Loading related content...