-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtalks.html
More file actions
62 lines (62 loc) · 2.68 KB
/
Copy pathtalks.html
File metadata and controls
62 lines (62 loc) · 2.68 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN"
"http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<meta name="generator" content="jemdoc, see http://jemdoc.jaboc.net/" />
<meta http-equiv="Content-Type" content="text/html;charset=utf-8" />
<link rel="stylesheet" href="jemdoc.css" type="text/css" />
<title>Zirui Zhou</title>
</head>
<body>
<table summary="Table for page layout." id="tlayout">
<tr valign="top">
<td id="layout-menu">
<div class="menu-item"><a href="index.html">Home</a></div>
<div class="menu-item"><a href="research.html">Research</a></div>
<div class="menu-item"><a href="talks.html" class="current">Talks</a></div>
<div class="menu-item"><a href="teaching.html">Teaching</a></div>
</td>
<td id="layout-content">
<div id="toptitle">
<h1>Zirui Zhou</h1>
</div>
<ul>
<li><p>Western Coast Optimization Meeting (WCOM 2017), Vancouver, Sep 2017 <br />
<i>Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming</i>. <a href="./talks/ALM-cplx_WCOM.pdf">[Slides]</a></p>
</li>
</ul>
<ul>
<li><p>Workshop on Modern Convex Optimization and Applications (AN70), Toronto, Jul 2017<br />
<i>Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming</i>. <a href="/talks/ALM-cplx_AN70.pdf">[Slides]</a></p>
</li>
</ul>
<ul>
<li><p>SIAM Conference on Optimization (OP17), Vancouver, May 2017 <br />
<i>A Unified Approach to Error Bounds for Structured Convex Optimization Problems</i>. <a href="/talks/SIAM-17.pdf">[Slides]</a></p>
</li>
</ul>
<ul>
<li><p>International Conference on Continuous Optimization (ICCOPT 2016), Tokyo, Aug 2016 <br />
<i>A Unified Approach to Error Bounds for Structured Convex Optimization Problems</i>. <a href="/talks/SIAM-17.pdf">[Slides]</a></p>
</li>
</ul>
<ul>
<li><p>International Symposium on Mathematical Programming (ISMP 2015), Pittsburgh, Jul 2015 <br />
<i>Trace Norm Regularization: Error Bounds and Convergence Rate Analysis of Proximal Gradient Method</i>. <a href="/talks/ISMP-15.pdf">[Slides]</a></p>
</li>
</ul>
<ul>
<li><p>International Conference on Machine Learning (ICML 2015), Lille, Jul 2015 <br />
<i><img class="eq" src="eqs/1405708801117690767-130.png" alt="ell_{1,p}" style="vertical-align: -6px" />-Norm Regularization: Error Bounds and Convergence Rate Analysis of First-Order Methods</i>. <a href="/talks/ICML-2015.pdf">[Slides]</a></p>
</li>
</ul>
<ul>
<li><p>IEEE International Conference on Computer Communications (INFOCOM 2014), Torino, Apr 2013 <br />
<i>A Polynomial-Time Nonconvex Optimization Approach to Network Localization</i>. <a href="/talks/infocom-2013.pdf">[Slides]</a></p>
</li>
</ul>
</td>
</tr>
</table>
</body>
</html>