Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem
From MaRDI portal
Publication:910459
DOI10.1007/BF01582253zbMath0696.15006MaRDI QIDQ910459
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
convex optimization; entropy optimization; conjugate duality; coordinate descent; dual optimization; matrix scaling; economic equilibrium modeling; nonlinear network optimization; truncated scaling
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C90: Applications of mathematical programming
94A17: Measures of information, entropy
15A12: Conditioning of matrices
Related Items
Interval-constrained matrix balancing, Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions
Cites Work
- 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
- On the scaling of multidimensional matrices
- Scalings of matrices which have prespecified row sums and column sums via optimization
- Generalized scalings satisfying linear equations
- Optimal spatial interaction and the gravity model
- On some methods for entropy maximization and matrix scaling
- Algorithms for proportional matrices in reals and integers
- Scaling of matrices to achieve specified row and column sums
- An Axiomatic Approach to Proportionality Between Matrices
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- On Pre-Conditioning of Matrices
- A Comparative Study of Algorithms for Matrix Balancing
- Line-sum-symmetric scalings of square nonnegative matrices
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- A note on solution of large sparse maximum entropy problems with linear equality constraints
- Properties of Kruithof's Projection Method
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
