Research Explorer
Papers
Conferences
Authors
Topics
Keywords
Trends
Achievements
Explore
← Optimization
Mathematics & Optimization
›
Optimization
›
Convex Optimization
589 directly classified papers
Papers per year
2004: 1
2005: 1
2006: 8
2007: 14
2008: 7
2009: 12
2010: 14
2011: 16
2012: 27
2013: 49
2014: 45
2015: 23
2016: 30
2017: 27
2018: 32
2019: 39
2020: 48
2021: 43
2022: 61
2023: 37
2024: 40
2025: 15
Papers
A Data Driven, Convex Optimization Approach to Learning Koopman Operators
L4DC 2021
Differentiating the Value Function by using Convex Duality
AISTATS 2021
Revisiting Projection-free Online Learning: the Strongly Convex Case
AISTATS 2021
Globally Optimal Relative Pose Estimation With Gravity Prior
CVPR 2021
A Quasiconvex Formulation for Radial Cameras
CVPR 2021
Low-Rank Extragradient Method for Nonsmooth and Low-Rank Matrix Optimization Problems
NIPS 2021
Semialgebraic Representation of Monotone Deep Equilibrium Models and Applications to Certification
NIPS 2021
DeepLM: Large-Scale Nonlinear Least Squares on Deep Learning Frameworks Using Stochastic Domain Decomposition
CVPR 2021
Contextual Recommendations and Low-Regret Cutting-Plane Algorithms
NIPS 2021
Graphical Models in Heavy-Tailed Markets
NIPS 2021
Heavy Ball Momentum for Conditional Gradient
NIPS 2021
Exploiting Sparsity for Neural Network Verification
L4DC 2021
Oblivious Sketching-based Central Path Method for Linear Programming
ICML 2021
Primal-dual Learning for the Model-free Risk-constrained Linear Quadratic Regulator
L4DC 2021
Three Operator Splitting with a Nonconvex Loss Function
ICML 2021
Accelerated Learning with Robustness to Adversarial Regressors
L4DC 2021
Chance-constrained quasi-convex optimization with application to data-driven switched systems control
L4DC 2021
Adaptive First-Order Methods Revisited: Convex Minimization without Lipschitz Requirements
NIPS 2021
Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization
NIPS 2021
Three Operator Splitting with Subgradients, Stochastic Gradients, and Adaptive Learning Rates
NIPS 2021
A Surrogate Objective Framework for Prediction+Programming with Soft Constraints
NIPS 2021
A convex optimization formulation for multivariate regression
NIPS 2020
Robust Policy Synthesis for Uncertain POMDPs via Convex Optimization
IJCAI 2020
A Flexible Framework for Designing Trainable Priors with Adaptive Smoothing and Game Encoding
NIPS 2020
Gradient Perturbation is Underrated for Differentially Private Convex Optimization
IJCAI 2020
<
1
…
7
8
9
…
24
>