Large-scale convex optimization via saddle point computation
From MaRDI portal
Recommendations
- Two general methods for computing saddle points with applications for decomposing convex programming problems
- scientific article; zbMATH DE number 3887456
- A computational study of the homogeneous algorithm for large-scale convex optimization
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- An interior point method for constrained saddle point problems
Cited in
(9)- Subgradient methods for saddle-point problems
- On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems.
- Linear convergence of primal-dual gradient methods and their performance in distributed optimization
- A randomized mirror-prox method for solving structured large-scale matrix saddle-point problems
- The equivalent model of the large sparse saddle point problem and its solving strategy
- On solving large-scale polynomial convex problems by randomized first-order algorithms
- Convex constrained optimization for large-scale generalized Sylvester equations
- Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution
- Semiglobal exponential stability of the discrete-time Arrow-Hurwicz-Uzawa primal-dual algorithm for constrained optimization
This page was built for publication: Large-scale convex optimization via saddle point computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770079)
