Dual subgradient algorithms for large-scale nonsmooth learning problems

Bruce Cox, Anatoli Juditsky, Arkadi Nemirovski

Open source

DOI
10.1007/s10107-013-0725-1
Published
2013-11-12
Container
Mathematical Programming
Publisher
Springer Science and Business Media LLC
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/s10107-013-0725-1,
  title = {Dual subgradient algorithms for large-scale nonsmooth learning problems},
  author = {Bruce Cox and Anatoli Juditsky and Arkadi Nemirovski},
  year = {2013},
  journal = {Mathematical Programming},
  doi = {10.1007/s10107-013-0725-1},
  url = {https://doi.org/10.1007/s10107-013-0725-1}
}

RIS

TY  - JOUR
TI  - Dual subgradient algorithms for large-scale nonsmooth learning problems
AU  - Bruce Cox
AU  - Anatoli Juditsky
AU  - Arkadi Nemirovski
PY  - 2013
JO  - Mathematical Programming
DO  - 10.1007/s10107-013-0725-1
UR  - https://doi.org/10.1007/s10107-013-0725-1
ER  - 

APA

Cox, B., Juditsky, A., & Nemirovski, A. (2013). Dual subgradient algorithms for large-scale nonsmooth learning problems. Mathematical Programming. https://doi.org/10.1007/s10107-013-0725-1

Source records