ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1806.08301
  4. Cited By
The Online Saddle Point Problem and Online Convex Optimization with
  Knapsacks

The Online Saddle Point Problem and Online Convex Optimization with Knapsacks

21 June 2018
Adrian Rivera Cardoso
He Wang
Huan Xu
ArXivPDFHTML

Papers citing "The Online Saddle Point Problem and Online Convex Optimization with Knapsacks"

5 / 5 papers shown
Title
Proximal Point Method for Online Saddle Point Problem
Proximal Point Method for Online Saddle Point Problem
Qing-xin Meng
Jian-wei Liu
39
0
0
05 Jul 2024
Online Saddle Point Problem and Online Convex-Concave Optimization
Online Saddle Point Problem and Online Convex-Concave Optimization
Qing-xin Meng
Jianwei Liu
14
0
0
12 Dec 2023
Online Non-convex Optimization with Long-term Non-convex Constraints
Online Non-convex Optimization with Long-term Non-convex Constraints
Shijie Pan
Wenjie Huang
24
0
0
04 Nov 2023
Constrained Online Two-stage Stochastic Optimization: Near Optimal
  Algorithms via Adversarial Learning
Constrained Online Two-stage Stochastic Optimization: Near Optimal Algorithms via Adversarial Learning
Jiashuo Jiang
21
0
0
02 Feb 2023
Kernel-based methods for bandit convex optimization
Kernel-based methods for bandit convex optimization
Sébastien Bubeck
Ronen Eldan
Y. Lee
84
164
0
11 Jul 2016
1