Convex Optimization
864 papers
Papers per year
1
1
11
17
10
16
23
22
35
59
54
39
34
27
35
48
63
52
74
51
88
83
21
'5
'10
'15
'20
'25
Papers
Project and Forget: Solving Large-Scale Metric Constrained Problems
JMLR 2022
Safe Online Convex Optimization with Unknown Linear Safety Constraints
AAAI 2022
Sampling Approximately Low-Rank Ising Models: MCMC meets Variational Methods
COLT 2022
Solving L1-regularized SVMs and Related Linear Programs: Revisiting the Effectiveness of Column and Constraint Generation
JMLR 2022
Steering vector correction in MVDR beamformer for speech enhancement
Interspeech 2022
Stochastic subgradient for composite convex optimization with functional constraints
JMLR 2022
Stochastic Variance Reduction for Variational Inequality Methods
COLT 2022
Support Recovery in Sparse PCA with Incomplete Data
NeurIPS 2022
The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound
NeurIPS 2022
The First Optimal Acceleration of High-Order Methods in Smooth Convex Optimization
NeurIPS 2022
The First Optimal Algorithm for Smooth and Strongly-Convex-Strongly-Concave Minimax Optimization
NeurIPS 2022
The power of first-order smooth optimization for black-box non-smooth problems
ICML 2022
Towards An Efficient Approach for the Nonconvex lp Ball Projection: Algorithm and Analysis
JMLR 2022
Understanding Riemannian Acceleration via a Proximal Extragradient Framework
COLT 2022
Uniform Stability for First-Order Empirical Risk Minimization
COLT 2022
Zeroth-Order Methods for Convex-Concave Min-max Problems: Applications to Decision-Dependent Risk Minimization
AISTATS 2022
Zonotope Domains for Lagrangian Neural Network Verification
NeurIPS 2022
Accelerated Algorithms for Smooth Convex-Concave Minimax Problems with O(1/k^2) Rate on Squared Gradient Norm
ICML 2021
Accelerated Learning with Robustness to Adversarial Regressors
L4DC 2021
Acceleration via Fractal Learning Rate Schedules
ICML 2021
Adaptive First-Order Methods Revisited: Convex Minimization without Lipschitz Requirements
NeurIPS 2021
Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities
AAAI 2021
A Data Driven, Convex Optimization Approach to Learning Koopman Operators
L4DC 2021
ADOM: Accelerated Decentralized Optimization Method for Time-Varying Networks
ICML 2021
A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters
JMLR 2021