Research Explorer
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Achievements
About
Methodology
← Optimization
Mathematics & Optimization
›
Optimization
›
Continuous Optimization
3907 directly classified papers
Papers per year
2001: 1
2002: 2
2004: 2
2005: 6
2006: 16
2007: 22
2008: 29
2009: 27
2010: 38
2011: 44
2012: 78
2013: 146
2014: 172
2015: 155
2016: 188
2017: 223
2018: 260
2019: 393
2020: 367
2021: 395
2022: 418
2023: 423
2024: 320
2025: 154
2026: 28
Papers
Fast Deterministic CUR Matrix Decomposition with Accuracy Assurance
ICML 2020
A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
NIPS 2020
Throughput-Optimal Topology Design for Cross-Silo Federated Learning
NIPS 2020
Provable Overlapping Community Detection in Weighted Graphs
NIPS 2020
Gaussian-Smoothed Optimal Transport: Metric Structure and Statistical Efficiency
AISTATS 2020
Revisiting Frank-Wolfe for Polytopes: Strict Complementarity and Sparsity
NIPS 2020
On the Role of Sparsity and DAG Constraints for Learning Linear DAGs
NIPS 2020
Continuous Regularized Wasserstein Barycenters
NIPS 2020
Diversity-Guided Multi-Objective Bayesian Optimization With Batch Evaluations
NIPS 2020
Efficient semidefinite-programming-based inference for binary and multi-class MRFs
NIPS 2020
Debiased Sinkhorn barycenters
ICML 2020
Differentiable Likelihoods for Fast Inversion of ’Likelihood-Free’ Dynamical Systems
ICML 2020
Inertial Block Proximal Methods for Non-Convex Non-Smooth Optimization
ICML 2020
A convex optimization formulation for multivariate regression
NIPS 2020
Neural Manifold Ordinary Differential Equations
NIPS 2020
Conformal Symplectic and Relativistic Optimization
NIPS 2020
Ratio Trace Formulation of Wasserstein Discriminant Analysis
NIPS 2020
A Feasible Level Proximal Point Method for Nonconvex Sparse Constrained Optimization
NIPS 2020
Interpolation Technique to Speed Up Gradients Propagation in Neural ODEs
NIPS 2020
Community detection using fast low-cardinality semidefinite programming
NIPS 2020
Conic Descent and its Application to Memory-efficient Optimization over Positive Semidefinite Matrices
NIPS 2020
Learning to solve TV regularised problems with unrolled algorithms
NIPS 2020
How many samples is a good initial point worth in Low-rank Matrix Recovery?
NIPS 2020
A novel variational form of the Schatten-$p$ quasi-norm
NIPS 2020
On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
ICML 2020
<
1
…
77
78
79
…
157
>