Pages that link to "Item:Q4346226"

The following pages link to Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints (Q4346226):

Displayed 10 items.

• Generalized Bregman projections in convex feasibility problems (Q1384057) ‎ (← links)
• Subgradient method with entropic projections for convex nondifferentiable minimization (Q1384058) ‎ (← links)
• Learning in games with continuous action sets and unknown payoff functions (Q1717237) ‎ (← links)
• Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems (Q2157903) ‎ (← links)
• Dykstras algorithm with bregman projections: A convergence proof (Q2709445) ‎ (← links)
• Learning in Games via Reinforcement and Regularization (Q2833105) ‎ (← links)
• Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming (Q3066922) ‎ (← links)
• On the Convergence of Gradient-Like Flows with Noisy Gradient Input (Q4602552) ‎ (← links)
• Revisiting linearized Bregman iterations under Lipschitz-like convexity condition (Q5058656) ‎ (← links)
• On the Convergence of Mirror Descent beyond Stochastic Convex Programming (Q5853716) ‎ (← links)