Convex Optimization

Follow this field Ask about this field

Recent momentum

emerging

0 papers in the last 28 days · 0.0% of indexed attention

Twelve weeks of publication activity for this topic as it is defined today.

Weekly history

Recent digests

What was published in this field, kept on the site without email delivery.

Period ending 2026-09-21

11 new papers

A weekly snapshot of new work published in Convex Optimization.

Period ending 2026-09-14

8 new papers

A weekly snapshot of new work published in Convex Optimization.

Period ending 2026-09-07

5 new papers

A weekly snapshot of new work published in Convex Optimization.

Inside this field

Focused directions

Focused topic

Convex Optimization

Within Convex Optimization

102 papersExplore

Focused topic

Convex Sets

Within Convex Optimization

72 papersExplore

Focused topic

Stochastic Optimization

Within Convex Optimization

46 papersExplore

Focused topic

Stochastic Smooth Convex Optimization

Within Convex Optimization

35 papersExplore

Focused topic

Nonconvex

Within Convex Optimization

28 papersExplore

241 papers

Latest in Convex Optimization

Browse all topics →

Convex-Geometric Error Bounds for Positive-Weight Kernel Quadrature
May 7, 2026Satoshi HayakawaKernel Hilbert Spaces Convex Sets
Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation
May 6, 2026Chengyu Cui, Gongjun XuLow-Rank Factorization Nonconvex
Grokability in five inequalities
May 6, 2026Paata Ivanisvili, Xinyuan XieInequalities Convex Sets
Exact Dual Geometry of SOC-ICNN Value Functions
May 6, 2026Kang Liu, Jianchen Hu, Wei PengGraph Neural Network Inference Convex Sets
A Provably Convergent and Practical Algorithm for Gromov--Wasserstein Optimal Transport
May 5, 2026Ling Liang, Lei YangGromov--Wasserstein Optimal Transport
Vanishing L2 regularization for the softmax Multi Armed Bandit
May 5, 2026Stefana-Lucia Anita, Gabriel TuriniciMulti-Armed Bandits Policy Gradient
Parametrizing Convex Sets Using Sublinear Neural Networks
May 5, 2026Eloi MartinetConvex Sets Neural-Network Approximation
Robust and Fast Training via Per-Sample Clipping
May 4, 2026Davide Nobile, Philipp GrohsGradient Clipping Stochastic Gradient Descent
A Parameter-Free First-Order Algorithm for Non-Convex Optimization with $\tilde{\mkern1mu O}(ε^{-5/3})$ Global Rate
May 4, 2026Sichao Xiong, Sadok Jerad, Coralia CartisConvex Optimization Zeroth-Order Optimization
Randomized Subspace Nesterov Accelerated Gradient
May 1, 2026Gaku Omiya, Pierre-Louis Poirion, Akiko TakedaConvex Sets
Bridging Graph Drawing and Dimensionality Reduction with Stochastic Stress Optimization
May 1, 2026Daniel Hangan, Stephen Kobourov, Jacob MillerDimensionality Reduction Stochastic Gradient Descent
High-Probability Convergence in Decentralized Stochastic Optimization with Gradient Tracking
Apr 30, 2026Aleksandar Armacki, Haoyuan Cai, Ali H. SayedStochastic Gradient Descent Stochastic Optimization
Global Optimality for Constrained Exploration via Penalty Regularization
Apr 30, 2026Florian Wolf, Ilyas Fatkhullin, Niao HePolicy Gradient Efficient Exploration
Information-Theoretic Generalization Bounds for Stochastic Gradient Descent with Predictable Virtual Noise
Apr 30, 2026Mohammad PartohaghighiStochastic Gradient Descent Generalization Bounds
Learning Over-Relaxation Policies for ADMM with Convergence Guarantees
Apr 29, 2026Junan Lin, Paul J. Goulart, Luca FurieriAlternating Direction Method Of Multiplier Convex Optimization
Optimization-Free Topological Sort for Causal Discovery via the Schur Complement of Score Jacobians
Apr 28, 2026Rui Wu, Hong XieCausal Foundation Models Topological Data Analysis
Stochastic simultaneous optimistic optimization
Apr 27, 2026Michal Valko, Alexandra Carpentier, Rémi MunosStochastic Optimization Maximization
BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization
Apr 27, 2026Bruno F. Lourenço, Hesham Morgan, Ana Ozaki +2Knowledge Graph Embeddings Global Embeddings
Safe Navigation in Unknown and Cluttered Environments via Direction-Aware Convex Free-Region Generation
Apr 26, 2026Zhicheng Song, Yongjian Li, Kai Chen +3Collision-Free Trajectories Navigation
A Layer Separation Optimization Framework for Cross-Entropy Training in Deep Learning
Apr 25, 2026Yaru Liu, Michael K. Ng, Yiqi GuCross-Entropy Losses Neural Network Optimization
Robust Out-of-Distribution Stochastic Optimization
Apr 22, 2026Xianyu Li, Huan Xu, Xiaolin Huang +1Out-Of-Distribution Stochastic Optimization
TESO: Online Tracking of Essential Matrix by Stochastic Optimization
Apr 21, 2026Jaroslav Moravec, Radim Šára, Akihiro SugimotoCamera Intrinsics Stochastic Optimization
Forward Dynamics of Variable Topology Mechanisms - The Case of Constraint Activation
Apr 21, 2026Andreas MuellerKinematic Chain Robotic Arms
The Cost of Relaxation: Evaluating the Error in Convex Neural Network Verification
Apr 20, 2026Merkouris Papamichail, Konstantinos Varsos, Giorgos Flouris +1Neural Network Verification Convex Sets
Efficient Diffusion Models under Nonconvex Equality and Inequality constraints via Landing
Apr 20, 2026Kijung Jeon, Michael Muehlebach, Molei TaoDiffusion Sampling Inequality Constraints
A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad, Shampoo and Muo
Apr 19, 2026S. Gratton, Ph. L. TointNonconvex Zeroth-Order Optimization
Negative Momentum for Convex-Concave Optimization
Apr 18, 2026Henry Shugart, Shuyi Wang, Jason M. AltschulerConvex Optimization Flat Minima
Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance
Apr 17, 2026Arda Fazla, Ege C. Kaya, Antesh Upadhyay +1Stochastic Smooth Convex Optimization Stochastic Gradient Descent
StoSignSGD: Unbiased Structural Stochasticity Fixes SignSGD for Training Large Language Models
Apr 16, 2026Dingzhi Yu, Rui Pan, Yuxing Liu +1Stochastic Gradient Descent Optimizer Design
Uniform a priori bounds and error analysis for the Adam stochastic gradient descent optimization method
Mar 19, 2026Steffen Dereich, Thang Do, Arnulf JentzenAdam Stochastic Smooth Convex Optimization
Convergence Rate of a Functional Learning Method for Contextual Stochastic Optimization
Mar 13, 2026Noel Smith, Andrzej RuszczynskiStochastic Optimization Learning-Augmented Algorithms
First-Order Softmax Weighted Switching Gradient Method for Distributed Stochastic Minimax Optimization with Stochastic Constraints
Mar 6, 2026Zhankun Luo, Antesh Upadhyay, Sang Bin Moon +1Stochastic Optimization Federated Learning
Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variations
Feb 4, 2026Hang Yu, Yu-Hu Yan, Peng ZhaoConvex Optimization Online Learning
Efficient Public Verification of Private ML via Regularization
Dec 3, 2025Zoë Ruha Bell, Anvith Thudi, Olive Franzese-McLaughlin +2Differential Privacy Privacy-Utility Trade-Offs
Distributed Dynamic Associative Memory via Online Convex Optimization
Nov 28, 2025Bowen Wang, Matteo Zecchin, Osvaldo SimeoneDense Associative Memory Learning-Augmented Algorithms
On the Condition Number Dependency in Bilevel Optimization
Nov 27, 2025Lesi Chen, Jingzhao ZhangBilevel Optimization Convex Optimization
Power Homotopy for Zeroth-Order Non-Convex Optimizations
Nov 17, 2025Chen XuConvex Optimization Smoothing
Learning and Testing Convex Functions
Nov 14, 2025Renato Ferreira Pinto, Cassandra Marcussen, Elchanan Mossel +1Convex Sets Optimal Sample Complexity
Adam symmetry theorem: characterization of the convergence of the stochastic Adam optimizer
Nov 10, 2025Steffen Dereich, Thang Do, Arnulf Jentzen +1Adam Stochastic Smooth Convex Optimization
Accelerated Frank-Wolfe Algorithms: Complementarity Conditions and Sparsity
Nov 4, 2025Dan GarberConvex Optimization Spectral Norm
The Optimization Landscape of Carathéodory Decomposition of Toeplitz Covariances
Nov 3, 2025Daniel Busbib, Ami WieselCovariance Estimation Convex Optimization
Accelerated stochastic first-order method for convex optimization under heavy-tailed noise
Oct 13, 2025Chuan He, Bowen Li, Zhaosong LuStochastic Smooth Convex Optimization
Smooth Quasar-Convex Optimization with Constraints
Oct 2, 2025David Martínez-RubioConvex Optimization Convex Sets
Modeling and Control of Deep Sign-Definite Dynamics with Application to Hybrid Powertrain Control
Sep 24, 2025Teruki Kato, Ryotaro Shima, Kenji KashimaModel Predictive Control Optimal Control
Convergence Analysis of the ProbAbilistic Gradient Estimator Algorithm for Weakly Convex Finite-Sum Optimization
Aug 31, 2025Laurent Condat, Peter RichtárikConvergence Analysis Convex Sets
DPO Unchained: Your Training Algorithm is Secretly Disentangled in Human Choice Theory (and its Loss' Convexity is Dispensable)
Jul 10, 2025Wenxuan Zhou, Shujian Zhang, Brice Magdalou +4Direct Preference Optimization Social Norms
Primal-dual algorithm for contextual stochastic combinatorial optimization
May 7, 2025Louis Bouvier, Thibault Prunet, Vincent Leclère +1Stochastic Optimization Primal-Dual Methods
Minimisation of Quasar-Convex Functions Using Random Zeroth-Order Oracles
May 4, 2025Amir Ali Farzin, Yuen-Man Pun, Philipp Braun +1Convex Sets Zeroth-Order Optimization
A Provably Convergent Plug-and-Play Framework for Stochastic Bilevel Optimization
May 2, 2025Tianshu Chu, Dachuan Xu, Wei Yao +2Bilevel Optimization Stochastic Optimization
Towards Weaker Variance Assumptions for Stochastic Optimization
Apr 14, 2025Ahmet Alacaoglu, Yura Malitsky, Stephen J. WrightStochastic Smooth Convex Optimization Stochastic Optimization
Mirror Descent Linearized Augmented Lagrangian Methods for Nonconvex Constrained Stochastic Zeroth-Order Optimization
Apr 13, 2025Qiankun Shi, Han Yuan, Xiao Wang +1Stochastic Smooth Convex Optimization Mirror Descent
A stochastic smoothing framework for nonconvex-nonconcave minEmax problems with applications to Wasserstein distributionally robust optimization
Feb 24, 2025Wei Liu, Muhammad Khan, Gabriel Mancino-Ball +1Stochastic Smooth Convex Optimization Robust Optimization
Convergence Rate Analysis of LION
Nov 12, 2024Yiming Dong, Huan Li, Zhouchen LinConvergence Analysis Stochastic Smooth Convex Optimization
Accelerated Stochastic Min-Max Optimization Based on Bias-corrected Momentum
Jun 18, 2024Haoyuan Cai, Sulaiman A. Alghunaim, Ali H. SayedStochastic Smooth Convex Optimization Convex Optimization
The best approximation pair problem relative to two subsets in a normed space
Mar 27, 2024Daniel Reem, Yair CensorApproximation Algorithms Metric Spaces
Semi-Bandit Learning for Monotone Stochastic Optimization
Dec 24, 2023Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan +1Linear Bandits Stochastic Optimization
Online Learning: A Modern Introduction Using Convex Optimization
Dec 31, 2019Francesco OrabonaLearning-Augmented Algorithms Convex Optimization
Silver Rate Is (Almost) Optimal for Gradient Descent
Date pendingYuhan Ye, Kaizhao LiuLarge Step Sizes Gradient Descent
Optimal Solutions for the Moving Target Vehicle Routing Problem with Obstacles via Lazy Branch-and-Price
Date pendingAnoop Bhat, Geordan Gutow, David Neiman +4Vehicle Routing Problem Shortest Paths
Block-Norm Geometries for Online Mirror Descent with Sparse Losses
Date pendingSwati Gupta, Jai Moondra, Mohit SinghMirror Descent Convex Optimization

May 7, 2026 · math.NAJ/K move · Enter open · S save

Convex-Geometric Error Bounds for Positive-Weight Kernel Quadrature

Satoshi Hayakawa

The University of Tokyo

Kernel quadrature can exploit RKHS spectral structure and outperform Monte Carlo on smooth integrands, but optimized quadrature weights are generally signed and may be numerically unstable. We study whether spectral acceleration remains possible when the weights are constrained to be positive, i.e., simplex weights. In the exact-target fixed-pool setting, an evaluated i.i.d. candidate pool of size

N

is already available and the task is to reweight it so as to approximate the kernel mean embedding. We show that this positive reweighting problem is governed not by the equal-weight empirical average, but by the random convex hull generated by the pool. Our main geometric result shows that the mean of a bounded

d

-dimensional random vector can be approximated by a convex combination of

N

i.i.d. samples at accuracy

O(d/N)

with high probability, sharper than equal-weight averaging in the fixed-dimensional regime. We transfer this

d

-dimensional convex-hull approximation to full RKHS worst-case error through an augmented Mercer-truncation argument. The resulting positive-weight KQ bounds consist of a spectral tail term and a finite-sample convex-hull term, yielding Monte-Carlo-beating rates in favorable spectral regimes, including near-

O(1/N)

rates up to logarithmic factors under exponential spectral decay. We also provide a constructive Frank--Wolfe algorithm that operates directly on the pool atoms, maintains simplex weights, and admits an explicit optimization-error bound.

Kernel Hilbert Spaces Convex Sets Concentration Inequalities Bayesian Quadrature Spectral Norm Upper Bounds Errors

Open paper Ask about it PDF