Deriving an unconstrained convex program for linear programming
type: Item
instance of: scholarly article
title: Deriving an unconstrained convex program for linear programming
zbMATH Open document ID: 0792.90046
DOI: 10.1007/BF00940495
author: J. R. Rajasekera
author: Shu-Cherng Fang
published in: Journal of Optimization Theory and Applications
publication date: 1994-04-27T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 557779
zbMATH Keywords: duality theory
zbMATH Keywords: entropic barrier function
zbMATH Keywords: generalized geometric programming
zbMATH Keywords: unconstrained convex programming
zbMATH Keywords: epsilon-optimal solution
MaRDI profile type: Publication
cites work: A new polynomial-time algorithm for linear programming
cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
cites work: Karmarkar's linear programming algorithm and Newton's method
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Insights into the interior-point methods
cites work: Entropy in linear programs
cites work: Confidence levels using noral approxiation to modifiedt-Statistics for dependent Variables
cites work: Quadratically constrained minimum cross-entropy analysis
cites work: Q5588268
cites work: Geometric Programming
cites work: Q5557595
cites work: On the convex programming approach to linear programming
full work available at URL: https://doi.org/10.1007/bf00940495
OpenAlex ID: W2022105289
description: scientific article; zbMATH DE number 557779