Pages that link to "Item:Q2220653"

The following pages link to Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems (Q2220653):

Displaying 29 items.

• Some worst-case datasets of deterministic first-order methods for solving binary logistic regression (Q2028922) (← links)
• On the oracle complexity of smooth strongly convex minimization (Q2052164) (← links)
• A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm (Q2128772) (← links)
• Accelerated gradient sliding for structured convex optimization (Q2141354) (← links)
• Cubic regularized Newton method for the saddle point models: a global and local convergence analysis (Q2148117) (← links)
• On lower iteration complexity bounds for the convex concave saddle point problems (Q2149573) (← links)
• Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle (Q2159456) (← links)
• Accelerated methods for saddle-point problem (Q2214606) (← links)
• A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems (Q4989936) (← links)
• Efficient Algorithms for Distributionally Robust Stochastic Optimization with Discrete Scenario Support (Q5003210) (← links)
• Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization (Q5093649) (← links)
• First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems (Q5097011) (← links)
• Efficient Search of First-Order Nash Equilibria in Nonconvex-Concave Smooth Min-Max Problems (Q5158768) (← links)
• Inexact model: a framework for optimization and variational inequalities (Q5865338) (← links)
• Higher-Order Methods for Convex-Concave Min-Max Optimization and Monotone Variational Inequalities (Q5869812) (← links)
• Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method (Q5883312) (← links)
• Accelerated and Instance-Optimal Policy Evaluation with Linear Function Approximation (Q5885838) (← links)
• A unified primal-dual algorithm framework for inequality constrained problems (Q6057147) (← links)
• Sion’s Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm (Q6060148) (← links)
• Cyclic Coordinate Dual Averaging with Extrapolation (Q6060151) (← links)
• A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems (Q6110456) (← links)
• Optimal Methods for Convex Risk-Averse Distributed Optimization (Q6116242) (← links)
• Graph Topology Invariant Gradient and Sampling Complexity for Decentralized and Stochastic Optimization (Q6116247) (← links)
• No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization (Q6126650) (← links)
• Robust Accelerated Primal-Dual Methods for Computing Saddle Points (Q6130545) (← links)
• Smooth monotone stochastic variational inequalities and saddle point problems: a survey (Q6160072) (← links)
• Primal-Dual First-Order Methods for Affinely Constrained Multi-block Saddle Point Problems (Q6161309) (← links)
• Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient (Q6168888) (← links)
• From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems (Q6179877) (← links)