Deriving an unconstrained convex program for linear programming

DOI10.1007/BF00940495zbMath0792.90046OpenAlexW2022105289MaRDI QIDQ1321279

J. R. Rajasekera, Shu-Cherng Fang

Publication date: 27 April 1994

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

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

zbMATH Keywords

duality theorygeneralized geometric programmingepsilon-optimal solutionentropic barrier functionunconstrained convex programming

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Linear programming (90C05)

Related Items (4)

Linearly constrained convex programming as unconstrained differentiable concave programming ⋮ Unconstrained convex programming approach to linear programming ⋮ On the entropic regularization method for solving min-max problems with applications ⋮ On the entropic perturbation and exponential penalty methods for linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Quadratically constrained minimum cross-entropy analysis
• Karmarkar's linear programming algorithm and Newton's method
• On the convex programming approach to linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Entropy in linear programs
• Confidence levels using noral approxiation to modifiedt-Statistics for dependent Variables
• Insights into the interior-point methods
• Geometric Programming

This page was built for publication: Deriving an unconstrained convex program for linear programming