Interior-point algorithm for quadratically constrained entropy minimization problems

DOI10.1007/BF00940780zbMath0797.90095OpenAlexW2026496434MaRDI QIDQ1321322

Jun Ji, Florian A. Potra

Publication date: 25 October 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940780

zbMATH Keywords

analytic centerquadratic constraintsinterior point algorithmglobal linear convergenceentropy minimizaiton

Mathematics Subject Classification ID

Nonlinear programming (90C30) Measures of information, entropy (94A17)

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• A polynomial-time algorithm, based on Newton's method, for linear programming
• On Q-order and R-order of convergence
• Quadratically constrained minimum cross-entropy analysis
• On the convergence of the method of analytic centers when applied to convex quadratic programs
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• Quadratically Constrained Information Theoretic Analysis
• A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
• A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems