Pages that link to "Item:Q4007117"
From MaRDI portal
The following pages link to An unconstrained convex programming view of linear programming (Q4007117):
Displayed 9 items.
- A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem (Q1342076) (← links)
- Perturbing the dual feasible region for solving convex quadratic programs (Q1367785) (← links)
- Entropic perturbation method for solving a system of linear inequalities (Q1612393) (← links)
- Linearly constrained convex programming as unconstrained differentiable concave programming (Q1897463) (← links)
- Implementation of an inexact approach to solving linear semi-infinite programming problems (Q1903653) (← links)
- Unconstrained convex programming approach to linear programming (Q1905944) (← links)
- On the entropic perturbation and exponential penalty methods for linear programming (Q1918012) (← links)
- A perturbation method for solving linear semi-infinite programming problems (Q1962976) (← links)
- An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions (Q4859453) (← links)