Cover Image

Mirror Duality in Convex Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kim, Jaeyeon, Park, Chanwoo, Ozdaglar, Asuman, Diakonikolas, Jelena, Ryu, Ernest K.
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal First-Order Algorithms as a Function of Inequalities
by: Park, Chanwoo, et al.
Published: (2021)

Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion
by: Diakonikolas, Jelena
Published: (2025)

A Block Coordinate and Variance-Reduced Method for Generalized Variational Inequalities of Minty Type
by: Diakonikolas, Jelena
Published: (2024)

Data Informativeness in Linear Optimization under Uncertainty
by: Bennouna, Omar, et al.
Published: (2026)

What Data Enables Optimal Decisions? An Exact Characterization for Linear Optimization
by: Bennouna, Omar, et al.
Published: (2025)

Zeroth-Order Constrained Optimization from a Control Perspective via Feedback Linearization
by: Zhang, Runyu, et al.
Published: (2025)

Min-Max Optimization with Dual-Linear Coupling
by: Mehta, Ronak, et al.
Published: (2025)

Optimal Acceleration for Minimax and Fixed-Point Problems is Not Unique
by: Yoon, TaeHo, et al.
Published: (2024)

Addressing misspecification in contextual optimization
by: Bennouna, Omar, et al.
Published: (2024)

Distributionally Robust Optimization with Adversarial Data Contamination
by: Li, Shuyao, et al.
Published: (2025)

Coordinate-Update Algorithms can Efficiently Detect Infeasible Optimization Problems
by: Paeng, Jinhee, et al.
Published: (2023)

Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions
by: Chari, Govind M., et al.
Published: (2026)

Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective
by: Diakonikolas, Jelena, et al.
Published: (2024)

Drago: Primal-Dual Coupled Variance Reduction for Faster Distributionally Robust Optimization
by: Mehta, Ronak, et al.
Published: (2024)

Last Iterate Convergence of Incremental Methods and Applications in Continual Learning
by: Cai, Xufeng, et al.
Published: (2024)

Offline Reinforcement Learning via Linear-Programming with Error-Bound Induced Constraints
by: Ozdaglar, Asuman, et al.
Published: (2022)

Robustly Learning Monotone Single-Index Models
by: Wang, Puqian, et al.
Published: (2025)

Nesterov Flow May Travel Infinitely Long to Converge to a Minimizer
by: Ryu, Ernest K.
Published: (2026)

Uniqueness of DRS as the 2 Operator Resolvent-Splitting and Impossibility of 3 Operator Resolvent-Splitting
by: Ryu, Ernest K.
Published: (2018)

Optimism as Risk-Seeking in Multi-Agent Reinforcement Learning
by: Zhang, Runyu, et al.
Published: (2025)

Robustly Learning Monotone Generalized Linear Models via Data Augmentation
by: Zarifis, Nikos, et al.
Published: (2025)

Adaptive Delayed-Update Cyclic Algorithm for Variational Inequalities
by: Wei, Yi, et al.
Published: (2026)

Learning a Single Neuron Robustly to Distributional Shifts and Adversarial Label Noise
by: Li, Shuyao, et al.
Published: (2024)

Finite-Sample Guarantees for Learning Dynamics in Zero-Sum Polymatrix Games
by: Faizal, Fathima Zarin, et al.
Published: (2024)

Computer-Assisted Design of Accelerated Composite Optimization Methods: OptISTA
by: Jang, Uijeong, et al.
Published: (2023)

Optimal Non-Asymptotic Rates of Value Iteration for Average-Reward Markov Decision Processes
by: Lee, Jongmin, et al.
Published: (2025)

Point Convergence of Nesterov's Accelerated Gradient Method: An AI-Assisted Proof
by: Jang, Uijeong, et al.
Published: (2025)

Empirical Risk Minimization with Shuffled SGD: A Primal-Dual Perspective and Improved Bounds
by: Cai, Xufeng, et al.
Published: (2023)

Equilibrium Selection for Multi-agent Reinforcement Learning: A Unified Framework
by: Zhang, Runyu, et al.
Published: (2024)

Robustly Learning Single-Index Models via Alignment Sharpness
by: Zarifis, Nikos, et al.
Published: (2024)

Accelerated Minimax Algorithms Flock Together
by: Yoon, TaeHo, et al.
Published: (2022)

Learning Decision-Sufficient Representations for Linear Optimization
by: Ye, Yuhan, et al.
Published: (2026)

Nesterov Acceleration with Operator Decomposition
by: Lee, Jaewook, et al.
Published: (2026)

Convergence Analyses of Davis-Yin Splitting via Scaled Relative Graphs
by: Lee, Jongmin, et al.
Published: (2022)

Convex Duality Made Difficult
by: Rischel, Eigil Fjeldgren
Published: (2026)

Policy Gradient Algorithms in Average-Reward Multichain MDPs
by: Lee, Jongmin, et al.
Published: (2026)

Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing
by: Li, Shuyao, et al.
Published: (2024)

Sharpness-Aware Minimization Can Hallucinate Minimizers
by: Park, Chanwoong, et al.
Published: (2025)

H-invariance theory: A complete characterization of minimax optimal fixed-point algorithms
by: Yoon, TaeHo, et al.
Published: (2025)

Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm
by: Cai, Xufeng, et al.
Published: (2025)