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
Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods
NIPS 2022
Joint Inference of Multiple Graphs from Matrix Polynomials
JMLR 2022
An Algorithm for Learning Switched Linear Dynamics from Data
NIPS 2022
A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters
JMLR 2021
Globally Optimal Relative Pose Estimation With Gravity Prior
CVPR 2021
From Low Probability to High Confidence in Stochastic Convex Optimization
JMLR 2021
A Quasiconvex Formulation for Radial Cameras
CVPR 2021
DeepLM: Large-Scale Nonlinear Least Squares on Deep Learning Frameworks Using Stochastic Domain Decomposition
CVPR 2021
Sparse and Smooth Signal Estimation: Convexification of L0-Formulations
JMLR 2021
Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities
AAAI 2021
Accelerated Algorithms for Smooth Convex-Concave Minimax Problems with O(1/k^2) Rate on Squared Gradient Norm
ICML 2021
ConvexVST: A Convex Optimization Approach to Variance-stabilizing Transformation
ICML 2021
Three Operator Splitting with a Nonconvex Loss Function
ICML 2021
Increasing Iterate Averaging for Solving Saddle-Point Problems
AAAI 2021
Smooth Convex Optimization Using Sub-Zeroth-Order Oracles
AAAI 2021
Oblivious Sketching-based Central Path Method for Linear Programming
ICML 2021
Gradient Descent Averaging and Primal-dual Averaging for Strongly Convex Optimization
AAAI 2021
Low Resource Quadratic Forms for Knowledge Graph Embeddings
EMNLP 2021
Computing an Efficient Exploration Basis for Learning with Univariate Polynomial Features
AAAI 2021
Learning with semi-definite programming: statistical bounds based on fixed point analysis and excess risk curvature
JMLR 2021
Transforms Based Tensor Robust PCA: Corrupted Low-Rank Tensors Recovery via Convex Optimization
ICCV 2021
ADOM: Accelerated Decentralized Optimization Method for Time-Varying Networks
ICML 2021
On a Combination of Alternating Minimization and Nesterov’s Momentum
ICML 2021
Acceleration via Fractal Learning Rate Schedules
ICML 2021
A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distance
ICML 2021
<
1
…
6
7
8
…
24
>