Interior-point algorithm for quadratically constrained entropy minimization problems
type: Item
instance of: scholarly article
title: Interior-point algorithm for quadratically constrained entropy minimization problems
zbMATH Open document ID: 0797.90095
DOI: 10.1007/BF00940780
published in: Journal of Optimization Theory and Applications
publication date: 1994-10-25T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 94A17
zbMATH DE Number: 557815
zbMATH Keywords: entropy minimizaiton
zbMATH Keywords: quadratic constraints
zbMATH Keywords: analytic center
zbMATH Keywords: global linear convergence
zbMATH Keywords: interior point algorithm
author: Jun Ji
author: Florian A. Potra
MaRDI profile type: Publication
cites work: Quadratically Constrained Information Theoretic Analysis
cites work: Quadratically constrained minimum cross-entropy analysis
cites work: A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
cites work: An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
cites work: A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
cites work: On the convergence of the method of analytic centers when applied to convex quadratic programs
cites work: Q3995706
cites work: Q5540119
cites work: A new polynomial-time algorithm for linear programming
cites work: On Q-order and R-order of convergence
full work available at URL: https://doi.org/10.1007/bf00940780
OpenAlex ID: W2026496434
description: scientific article; zbMATH DE number 557815