Linearly constrained convex programming as unconstrained differentiable concave programming
From MaRDI portal
Publication:1897463
Recommendations
- Unconstrained convex programming approach to linear programming
- A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
- An unconstrained convex programming view of linear programming
- Deriving an unconstrained convex program for linear programming
- A generalized interior-point barrier function approach for smooth convex programming with linear constraints
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- An unconstrained convex programming view of linear programming
- Convex Analysis
- Deriving an unconstrained convex program for linear programming
- Least-norm linear programming solution as an unconstrained minimization problem
Cited in
(7)- On solving difference of convex functions programs with linear complementarity constraints
- An unconstrained convex programming view of linear programming
- scientific article; zbMATH DE number 1528596 (Why is no real title available?)
- On the entropic perturbation and exponential penalty methods for linear programming
- Unconstrained convex programming approach to linear programming
- Strict quasi-concavity and the differential barrier property of gauges in linear programming
- An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions
This page was built for publication: Linearly constrained convex programming as unconstrained differentiable concave programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897463)
