Pages that link to "Item:Q1915910"

The following pages link to A simplified homogeneous and self-dual linear programming algorithm and its implementation (Q1915910):

Displaying 17 items.

• Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
• Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
• The practical behavior of the homogeneous self-dual formulations in interior point methods (Q302143) (← links)
• A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
• Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
• On homogeneous and self-dual algorithms for LCP (Q1361111) (← links)
• Deriving potential functions via a symmetry principle for nonlinear equations (Q1375121) (← links)
• Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
• Design and implementation of a modular interior-point solver for linear optimization (Q2062319) (← links)
• Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
• Advances in the simulation of viscoplastic fluid flows using interior-point methods (Q2310212) (← links)
• An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
• On the behavior of the homogeneous self-dual model for conic convex optimization (Q2492677) (← links)
• A primal-dual decomposition algorithm for multistage stochastic convex programming (Q2571003) (← links)
• Interior-point methods for linear programming: a review (Q3150491) (← links)
• On implementation of a self-dual embedding method for convex programming (Q3377974) (← links)
• Performance enhancements for a generic conic interior point algorithm (Q6102857) (← links)