Efficient numerical methods for entropy-linear programming problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2147603
- A maximum entropy method for linear programming
- scientific article; zbMATH DE number 954662
- An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints
- New class of multiplicative algorithms for solving of entropy-linear programs
- Dual multiplicative algorithms for an entropy-linear programming problem
- On the entropic perturbation and exponential penalty methods for linear programming
- An extension of the entropic perturbation method of linear programming
- Linear programming with entropic perturbation
- Entropic approach to interior point solution of linear programs
Cites work
- scientific article; zbMATH DE number 3790207 (Why is no real title available?)
- scientific article; zbMATH DE number 51089 (Why is no real title available?)
- scientific article; zbMATH DE number 1082203 (Why is no real title available?)
- scientific article; zbMATH DE number 3216702 (Why is no real title available?)
- Convex optimization: algorithms and complexity
- Double smoothing technique for large-scale linearly constrained convex optimization
- Dual multiplicative algorithms for an entropy-linear programming problem
- Entropy in the sense of Boltzmann and Poincaré
- Entropy optimization and mathematical programming
- Evolutionary interpretations of entropy model for correspondence matrix calculation
- Macrosystems theory and its applications. Equilibrium models
- On entropy-type functionals arising in stochastic chemical kinetics related to the concentration of the invariant measure and playing the role of Lyapunov functions in the dynamics of quasiaverages
- On the scaling of multidimensional matrices
- On the three-stage version of stable dynamic model
- Probability Theory
- Reversibility and irreversibility in stochastic chemical kinetics
- Saddle point mirror descent algorithm for the robust PageRank problem
- Smooth minimization of non-smooth functions
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
Cited in
(19)- Decentralized convex optimization on time-varying networks with application to Wasserstein barycenters
- Accelerated proximal envelopes: application to componentwise methods
- On the computational efficiency of catalyst accelerated coordinate descent
- Models and algorithms of the entropy programming
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
- Numerical methods for the resource allocation problem in a computer network
- Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods
- New class of multiplicative algorithms for solving of entropy-linear programs
- Universal method of searching for equilibria and stochastic equilibria in transportation networks
- Accelerated gradient methods with absolute and relative noise in the gradient
- scientific article; zbMATH DE number 4191003 (Why is no real title available?)
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- A dual approach for optimal algorithms in distributed optimization over networks
- Nonequispaced fast Fourier transform boost for the Sinkhorn algorithm
- Universal method for stochastic composite optimization problems
- Randomized methods for computing optimal transport without regularization and their convergence analysis
- scientific article; zbMATH DE number 2147603 (Why is no real title available?)
- Models and algorithms of the entropy programming
- Accuracy certificates for convex minimization with inexact oracle
This page was built for publication: Efficient numerical methods for entropy-linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327229)
