Pages that link to "Item:Q2350862"

The following pages link to Mirror Prox algorithm for multi-term composite minimization and semi-separable problems (Q2350862):

Displaying 8 items.

• A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
• Proximal primal-dual best approximation algorithm with memory (Q1756584) (← links)
• Point process estimation with Mirror Prox algorithms (Q2019904) (← links)
• On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (Q2136507) (← links)
• Accelerated gradient sliding for structured convex optimization (Q2141354) (← links)
• Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization (Q2232754) (← links)
• Optimal subgradient methods: computational properties for large-scale linear inverse problems (Q2315075) (← links)
• A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems (Q6097769) (← links)