Linear programming with entropic perturbation

DOI10.1007/BF01414155MaRDI QIDQ5286755zbMATH OpenOpenAlexFDO

Authors Shu-Cherng Fang, H.-S. Jacob Tsao

Publication date 15 December 1993

Published in ZOR - Methods and Models of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

\(\varepsilon\)-optimal solutioncurved search algorithmdualityentropic perturbationquadratic rate of convergence

Mathematics Subject Classification ID

Existence theories for free problems in two or more independent variables (49J10) Linear programming (90C05) Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 818537
• A maximum entropy method for linear programming
• Entropic approach to interior point solution of linear programs
• scientific article; zbMATH DE number 934835
• An unconstrained convex programming view of linear programming

Cites work

• A new polynomial-time algorithm for linear programming
• A potential-reduction variant of Renegar's short-step path-following method for linear programming
• Curved search methods for unconstrained optimization
• Entropy in linear programs
• Geometric Programming
• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 3972625 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3591873 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• On the convex programming approach to linear programming
• Quadratically constrained minimum cross-entropy analysis

Cited in

(19)

• A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem
• Entropic approach to interior point solution of linear programs
• Entropic perturbation method for solving a system of linear inequalities
• An extension of the entropic perturbation method of linear programming
• Implementation of an inexact approach to solving linear semi-infinite programming problems
• Unconstrained convex programming approach to linear programming
• On the entropic perturbation and exponential penalty methods for linear programming
• An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints
• A perturbation method for solving linear semi-infinite programming problems
• Efficient numerical methods for entropy-linear programming problems
• A maximum entropy method for linear programming
• An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem
• scientific article; zbMATH DE number 5509939 (Why is no real title available?)
• scientific article; zbMATH DE number 1782200 (Why is no real title available?)
• scientific article; zbMATH DE number 1372508 (Why is no real title available?)
• scientific article; zbMATH DE number 818537 (Why is no real title available?)
• An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions
• scientific article; zbMATH DE number 934835 (Why is no real title available?)
• scientific article; zbMATH DE number 6539624 (Why is no real title available?)

This page was built for publication: Linear programming with entropic perturbation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286755)