Alternating direction method for maximum entropy subject to simple constraint sets.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3868459 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- A class of projection and contraction methods for monotone variational inequalities
- A note on solution of large sparse maximum entropy problems with linear equality constraints
- An algorithm for maximizing entropy subject to simple bounds
- Estimation of the most likely equilibrium traffic queueing pattern in a capacity constrained network
- Inexact implicit methods for monotone general variational inequalities
- Solution and applications of a class of general linear variational inequalities
Cited in
(4)- Inexact proximal point method for general variational inequalities
- A projection algorithm for general variational inequalities with perturbed constraint sets
- An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem
- The multidimensional moment-constrained maximum entropy problem: A BFGS algorithm with constraint scaling
This page was built for publication: Alternating direction method for maximum entropy subject to simple constraint sets.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703173)