Convex Optimization

Follow this topic Ask about this topic

Recent momentum

+22%

11 papers in the last 28 days · 0.2% 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 topic, kept on the site without email delivery.

Period ending 2026-09-21

5 new papers

A weekly snapshot of new work published in Convex Optimization.

Period ending 2026-09-14

5 new papers

A weekly snapshot of new work published in Convex Optimization.

Period ending 2026-09-07

2 new papers

A weekly snapshot of new work published in Convex Optimization.

102 papers

Latest in Convex Optimization

Browse all topics →

A Geometric Approach to Constrained Online Learning
May 20, 2026Dhruv Sarkar, Abhishek SinhaConvex Optimization O(T^Β)$ Simultaneous Regret
Robust Subspace-Constrained Quadratic Models for Low-Dimensional Structure Learning
May 19, 2026Zheng Zhai, Xiaohui LiLow-Dimensional Structure Least Squares
Accelerated Gradient Descent for Faster Convergence with Minimal Overhead
May 15, 2026Manuel Graca, L. Miguel Silveira, Arlindo Oliveira +1Mini-Batch Stochastic Gradient Descent Gradient Descent
Beyond Bounded Variance: Variance-Reduced Normalized Methods for Nonconvex Optimization under Blum-Gladyshev Noise
May 14, 2026Antesh Upadhyay, Arda Fazla, Abolfazl HashemiStochastic Smooth Convex Optimization Convex Optimization
Min-Max Optimization Requires Exponentially Many Queries
May 13, 2026Martino Bernasconi, Matteo Castiglioni, Andrea Celli +1Convex Optimization Nonconvex
Online Learning-to-Defer with Varying Experts
May 12, 2026Dang Hoang Duy, Yannis Montreuil, Maxime Meyer +3Learning-Augmented Algorithms Experts
Constrained Stochastic Spectral Preconditioning Converges for Nonconvex Objectives
May 12, 2026Konstantinos Oikonomidis, Jan Quan, Kimon Antonakopoulos +3Spectral Preconditioning Convex Optimization
Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses
May 11, 2026Yuhan YeStationarity Convex Optimization
Function-Space ADMM for Decentralized Federated Learning: A Control Theoretic Perspective
May 10, 2026Akihito Taya, Yuuki Nishiyama, Kaoru SezakiFederated Learning Distributional Learning
SHIELD: Scalable Optimal Control with Certification using Duality and Convexity
May 9, 2026Hansung Kim, Siddharth H. Nair, Francesco BorrelliModel Predictive Control Optimal Control
A Tale of Two Problems: Multi-Task Bilevel Learning Meets Equality Constrained Multi-Objective Optimization
May 9, 2026Zhiyao Zhang, Myeung Suk Oh, Zhen Qin +3Bilevel Optimization Multi-Objective Optimization
Rennala MVR: Improved Time Complexity for Parallel Stochastic Optimization via Momentum-Based Variance Reduction
May 9, 2026Zhirayr Tovmasyan, Artavazd Maranjyan, Peter RichtárikVariance Reduction Stochastic Gradient Descent
Convex Optimization with Nested Evolving Feasible Sets
May 8, 2026Karthick Krishna M., Haricharan Balasundaram, Rahul VazeConvex Optimization O(T^Β)$ Simultaneous Regret
When Descent Is Too Stable: Event-Triggered Hamiltonian Learning to Optimize
May 7, 2026Yi Wang, Chandrajit BajajConvex Optimization Descent
Distributionally-Robust Learning to Optimize
May 7, 2026Vinit Ranjan, Jisun Park, Bartolomeo StellatoRobust Optimization Distributional Learning
When Does $\ell_2$ -Boosting Overfit Benignly? High-Dimensional Risk Asymptotics and the $\ell_1$ Implicit Bias
May 7, 2026Ye Su, Jian Li, Yong LiuOverfitting Empirical Risk Minimization
Power-Efficiency and Scalability Analysis of Magnetically-Actuated Satellite Swarms via Convex Optimization
May 7, 2026Yuta Takahashi, Seang Shim, Hiraku Sakamoto +1Unmanned Aerial Vehicle Swarms Satellite
Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation
May 6, 2026Chengyu Cui, Gongjun XuLow-Rank Factorization Nonconvex
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
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
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
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
Forward Dynamics of Variable Topology Mechanisms - The Case of Constraint Activation
Apr 21, 2026Andreas MuellerKinematic Chain Robotic Arms
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
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
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
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
Towards Weaker Variance Assumptions for Stochastic Optimization
Apr 14, 2025Ahmet Alacaoglu, Yura Malitsky, Stephen J. WrightStochastic Smooth Convex Optimization Stochastic 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
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
Block-Norm Geometries for Online Mirror Descent with Sparse Losses
Date pendingSwati Gupta, Jai Moondra, Mohit SinghMirror Descent Convex Optimization

May 20, 2026 · cs.LGJ/K move · Enter open · S save

A Geometric Approach to Constrained Online Learning

Dhruv Sarkar, Abhishek Sinha

Indian Institute of Technology Kharagpur · Mohamed bin Zayed University of Artificial Intelligence · Tata Institute of Fundamental Research, Mumbai

We study constrained online convex optimization with adversarial time-varying constraints. At each round the learner acts before observing the loss and constraint, and is compared with the best fixed action satisfying all constraints in hindsight. The goal is to obtain minimax-optimal regret while controlling cumulative constraint violation (CCV). Prior algorithms achieved

O(\log T)

regret with

O(\sqrt{T\log T})

CCV for strongly convex losses, and

O(\sqrt{T})

regret with

O(\sqrt{T}\log T)

CCV for convex losses. We propose NP-OGD, an iterated nested-projection algorithm. For strongly convex losses it achieves

O(\log T)

regret and

O(\log T)

CCV; for convex losses it achieves

O(\sqrt{T})

regret and

O(\sqrt{T})

CCV. The analysis relies on a geometric movement bound: after lifting the nested projected-gradient trajectory to one higher dimension, the lifted path is self-contracted under a nonstandard norm, so a finite-length theorem for self-contracted curves controls the total projection movement. We also prove complementary lower bounds using layered sphere packings. For strongly convex losses, any online algorithm with polynomially sublinear regret can incur CCV at least

Ω((\log T)^{(d-1)/(d+1)}/\log\log T)

. For convex losses, we prove CCV lower bounds

Ω(T^{(d-1)/(2(d+3))})

for weakly adaptive algorithms and

Ω(T^{(d-1)/(2d)})

for NP-OGD. Finally, for the constrained experts special case over

N

experts, an active Hedge algorithm attains

O(\sqrt{T\log N})

regret and

O(N)

CCV, with a matching minimax CCV lower bound for sufficiently large horizons.

Convex Optimization O(T^Β)$ Simultaneous Regret Learning-Augmented Algorithms

Open paper Ask about it PDF

Recent momentum

Neighbouring directions

Recent digests

5 new papers

5 new papers

2 new papers

Latest in Convex Optimization