Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem
DOI10.1007/BF01582253zbMATH Open0696.15006OpenAlexW1970612864MaRDI QIDQ910459FDOQ910459
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582253
Recommendations
- Scalings of matrices which have prespecified row sums and column sums via optimization
- Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions
- Generalized scalings satisfying linear equations
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
- A Comparative Study of Algorithms for Matrix Balancing
convex optimizationcoordinate descententropy optimizationdual optimizationconjugate dualitymatrix scalingeconomic equilibrium modelingnonlinear network optimizationtruncated scaling
Numerical mathematical programming methods (65K05) Convex programming (90C25) Applications of mathematical programming (90C90) Measures of information, entropy (94A17) Conditioning of matrices (15A12)
Cites Work
- Title not available (Why is that?)
- Convex Analysis
- Scaling of matrices to achieve specified row and column sums
- Title not available (Why is that?)
- Optimal spatial interaction and the gravity model
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Algorithms for proportional matrices in reals and integers
- An Axiomatic Approach to Proportionality Between Matrices
- A Comparative Study of Algorithms for Matrix Balancing
- On Pre-Conditioning of Matrices
- Line-sum-symmetric scalings of square nonnegative matrices
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- Title not available (Why is that?)
- On the scaling of multidimensional matrices
- Generalized scalings satisfying linear equations
- A note on solution of large sparse maximum entropy problems with linear equality constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- On some methods for entropy maximization and matrix scaling
- An extension of a theorem of Darroch and Ratcliff in loglinear models and its application to scaling multidimensional matrices
- Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions
- Scalings of matrices which have prespecified row sums and column sums via optimization
- Properties of Kruithof's Projection Method
Cited In (6)
- Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions
- Interval-constrained matrix balancing
- Biproportional scaling of matrices and the iterative proportional fitting procedure
- Perron vector optimization applied to search engines
- Generalized scalings satisfying linear equations
- Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment
This page was built for publication: Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910459)
