Pages that link to "Item:Q4007117"

The following pages link to An unconstrained convex programming view of linear programming (Q4007117):

Displaying 13 items.

• An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem (Q353167) (← links)
• 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)
• The convergent behavior for parametric generalized vector equilibrium problems (Q1952779) (← links)
• A perturbation method for solving linear semi-infinite programming problems (Q1962976) (← links)
• Generalized Sinkhorn Iterations for Regularizing Inverse Problems Using Optimal Mass Transport (Q4689648) (← links)
• An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions (Q4859453) (← links)
• Semi-discrete optimal transport: hardness, regularization and numerical solution (Q6038666) (← links)