Pages that link to "Item:Q327229"
From MaRDI portal
The following pages link to Efficient numerical methods for entropy-linear programming problems (Q327229):
Displaying 17 items.
- Models and algorithms of the entropy programming (Q1429405) (← links)
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints (Q1683173) (← links)
- Universal method for stochastic composite optimization problems (Q1746349) (← links)
- Accelerated proximal envelopes: application to componentwise methods (Q2116598) (← links)
- On the computational efficiency of catalyst accelerated coordinate descent (Q2117631) (← links)
- Universal method of searching for equilibria and stochastic equilibria in transportation networks (Q2314190) (← links)
- New class of multiplicative algorithms for solving of entropy-linear programs (Q2503213) (← links)
- Numerical methods for the resource allocation problem in a computer network (Q2662812) (← links)
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems (Q2701420) (← links)
- (Q3210051) (← links)
- A dual approach for optimal algorithms in distributed optimization over networks (Q5859014) (← links)
- Accelerated gradient methods with absolute and relative noise in the gradient (Q6087056) (← links)
- Nonequispaced fast Fourier transform boost for the Sinkhorn algorithm (Q6105414) (← links)
- Decentralized convex optimization on time-varying networks with application to Wasserstein barycenters (Q6149580) (← links)
- Randomized methods for computing optimal transport without regularization and their convergence analysis (Q6571381) (← links)
- Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods (Q6644994) (← links)
- Accuracy certificates for convex minimization with inexact oracle (Q6661688) (← links)
