Linearly constrained convex programming as unconstrained differentiable concave programming (Q1897463)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linearly constrained convex programming as unconstrained differentiable concave programming |
scientific article |
Statements
Linearly constrained convex programming as unconstrained differentiable concave programming (English)
0 references
27 August 1995
0 references
Recently, Fang proposed approximating a linear program in Karmarkar's standard form by adding an entropic barrier function to the objective function and using a certain geometric inequality to transform the resulting problem into an unconstrained differentiable concave program. We show that, by using standard duality theory for convex programming, the results of Fang and his coworkers can be strengthened and extended to linearly constrained convex programs and more general barrier functions.
0 references
duality
0 references
approximations
0 references
entropic barrier function
0 references
unconstrained differentiable concave program
0 references