Skip to main content
English
中文
Log In
Log in
Log in with ORCID
NTU Single Sign On
Have you forgotten your password?
Home
College of Electrical Engineering and Computer Science / 電機資訊學院
Computer Science and Information Engineering / 資訊工程學系
Iteration complexity of feasible descent methods for onvex optimization
Details
Iteration complexity of feasible descent methods for onvex optimization
Journal
Journal of Machine Learning Research
Journal Volume
15
Pages
1523-1548
Date Issued
2014
Author(s)
CHIH-JEN LIN
Wang, P.-W.
CHIH-JEN LIN
URI
http://www.scopus.com/inward/record.url?eid=2-s2.0-84901632905&partnerID=MN8TOARS
http://scholars.lib.ntu.edu.tw/handle/123456789/386756
Type
journal article
