Pages that link to "Item:Q2770079"
From MaRDI portal
The following pages link to Large-scale convex optimization via saddle point computation (Q2770079):
Displaying 9 items.
- Convex constrained optimization for large-scale generalized Sylvester equations (Q535294) (← links)
- Subgradient methods for saddle-point problems (Q1035898) (← links)
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305) (← links)
- Linear convergence of primal-dual gradient methods and their performance in distributed optimization (Q2184550) (← links)
- A randomized mirror-prox method for solving structured large-scale matrix saddle-point problems (Q2848180) (← links)
- The equivalent model of the large sparse saddle point problem and its solving strategy (Q2927466) (← links)
- On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms (Q5252231) (← links)
- Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution (Q6071888) (← links)
- Semiglobal exponential stability of the discrete-time Arrow-Hurwicz-Uzawa primal-dual algorithm for constrained optimization (Q6634536) (← links)
