conftrace
_
Papers
Trends
Conferences
Explore
Authors
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Achievements
← 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
Relative Interior Rule in Block-Coordinate Descent
CVPR 2020
Optimal least-squares solution to the hand-eye calibration problem
CVPR 2020
Robust Tensor Decomposition via Orientation Invariant Tubal Nuclear Norms
AAAI 2020
Joint Partial Optimal Transport for Open Set Domain Adaptation
IJCAI 2020
Proximal Gradient Algorithm with Momentum and Flexible Parameter Restart for Nonconvex Optimization
IJCAI 2020
Dinkelbach-Type Algorithm for Computing Quantal Stackelberg Equilibrium
IJCAI 2020
A Unified Analysis of Extra-gradient and Optimistic Gradient Methods for Saddle Point Problems: Proximal Point Approach
AISTATS 2020
A Fast Anderson-Chebyshev Acceleration for Nonlinear Optimization
AISTATS 2020
Numerically Solving Parametric Families of High-Dimensional Kolmogorov Partial Differential Equations via Deep Learning
NIPS 2020
Non-Rigid Structure from Motion: Prior-Free Factorization Method Revisited
WACV 2020
Depth Completion via Deep Basis Fitting
WACV 2020
Beyond Lazy Training for Over-parameterized Tensor Decomposition
NIPS 2020
Geodesically-convex optimization for averaging partially observed covariance matrices
ACML 2020
Robust Document Distance with Wasserstein-Fisher-Rao metric
ACML 2020
Scalable Calibration of Affinity Matrices from Incomplete Observations
ACML 2020
A First Principles Approach for Data-Efficient System Identification of Spring-Rod Systems via Differentiable Physics Engines
L4DC 2020
Complexity Guarantees for Polyak Steps with Momentum
COLT 2020
The Gradient Complexity of Linear Regression
COLT 2020
Highly smooth minimization of non-smooth problems
COLT 2020
Gradient descent algorithms for Bures-Wasserstein barycenters
COLT 2020
Halpern Iteration for Near-Optimal and Parameter-Free Monotone Inclusion and Strong Solutions to Variational Inequalities
COLT 2020
On the Convergence of Stochastic Gradient Descent with Low-Rank Projections for Convex Low-Rank Matrix Problems
COLT 2020
Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems
COLT 2020
Nearly Non-Expansive Bounds for Mahalanobis Hard Thresholding
COLT 2020
Leading Multi-Agent Teams to Multiple Goals While Maintaining Communication
RSS 2020
<
1
…
71
72
73
…
157
>