Paul Tseng

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▷ joint publications with Sangwoon Yun

> Home > Persons > Paul Tseng

Publications

2014
[j78]
- view
  authority control:
- export record
  dblp key:
  - journals/jota/TsengY14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jota/TsengY14
Paul Tseng, Sangwoon Yun:
Incrementally Updated Gradient Methods for Constrained and Regularized Optimization. J. Optim. Theory Appl. 160(3): 832-853 (2014)
2011
[j72]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/YunTT11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/YunTT11
Sangwoon Yun, Paul Tseng, Kim-Chuan Toh:
A block coordinate gradient descent method for regularized convex separable optimization and covariance selection. Math. Program. 129(2): 331-355 (2011)
2010
[j70]
- view
  authority control:
- export record
  dblp key:
  - journals/coap/TsengY10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/coap/TsengY10
Paul Tseng, Sangwoon Yun:
A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training. Comput. Optim. Appl. 47(2): 179-206 (2010)
2009
[j66]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/TsengY09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/TsengY09
Paul Tseng, Sangwoon Yun:
A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117(1-2): 387-423 (2009)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.