Pages that link to "Item:Q1361111"

The following pages link to On homogeneous and self-dual algorithms for LCP (Q1361111):

Displaying 14 items.

• An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem (Q279835) (← links)
• Sparse solutions of linear complementarity problems (Q312696) (← links)
• A homogeneous smoothing-type algorithm for symmetric cone linear programs (Q477482) (← links)
• Improved bounds on the energy-minimizing strains in martensitic polycrystals (Q510633) (← links)
• Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
• A new path-following algorithm for nonlinear \(P_*\) complementarity problems (Q853548) (← links)
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding (Q1362529) (← links)
• A homogeneous model for monotone mixed horizontal linear complementarity problems (Q1734775) (← links)
• An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods (Q2089775) (← links)
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems (Q2249820) (← links)
• A logarithmic descent direction algorithm for the quadratic knapsack problem (Q2287590) (← links)
• A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems (Q2422131) (← links)
• A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties (Q2480789) (← links)
• An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones (Q2970393) (← links)