Convex Optimization

Non-Ergodic Alternating Proximal Augmented Lagrangian Algorithms with Optimal Rates NeurIPS 2018 Online Adaptive Methods, Universality and Acceleration NeurIPS 2018 Online Continuous-Time Tensor Factorization Based on Pairwise Interactive Point Processes IJCAI 2018 On the Convergence of Adam and Beyond ICLR 2018 Optimal Algorithms for Non-Smooth Distributed Optimization in Networks NeurIPS 2018 Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity ICML 2018 Provable Estimation of the Number of Blocks in Block Models AISTATS 2018 Provable Variational Inference for Constrained Log-Submodular Models NeurIPS 2018 Randomized Block Cubic Newton Method ICML 2018 Saturating Splines and Feature Selection JMLR 2018 Smoothed analysis of the low-rank approach for smooth semidefinite programs NeurIPS 2018 Stochastic PCA with ℓ_2 and ℓ_1 Regularization ICML 2018 The Physical Systems Behind Optimization Algorithms NeurIPS 2018 TRAINING GENERATIVE ADVERSARIAL NETWORKS VIA PRIMAL-DUAL SUBGRADIENT METHODS: A LAGRANGIAN PERSPECTIVE ON GAN ICLR 2018 Zeroth-order (Non)-Convex Stochastic Optimization via Conditional Gradient and Gradient Updates NeurIPS 2018 Active-set Methods for Submodular Minimization Problems JMLR 2017 Adaptive Accelerated Gradient Converging Method under H\"{o}lderian Error Bound Condition NeurIPS 2017 Adaptive Clustering through Semidefinite Programming NeurIPS 2017 ADMM without a Fixed Penalty Parameter: Faster Convergence with New Adaptive Penalization NeurIPS 2017 A New Alternating Direction Method for Linear Programming NeurIPS 2017 A Semismooth Newton Method for Fast, Generic Convex Programming ICML 2017 Clustering by Sum of Norms: Stochastic Incremental Algorithm, Convergence and Cluster Recovery ICML 2017 Convex Global 3D Registration With Lagrangian Duality CVPR 2017 Convex Phase Retrieval without Lifting via PhaseMax ICML 2017 Decomposition-Invariant Conditional Gradient for General Polytopes with Line Search NeurIPS 2017