Pages that link to "Item:Q1202150"

The following pages link to A unified approach to interior point algorithms for linear complementary problems (Q1202150):

Displaying 43 items.

• Large-update interior point algorithm for \(P_*\)-linear complementarity problem (Q257756) (← links)
• A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP (Q279828) (← links)
• A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function (Q290328) (← links)
• A polynomial interior-point algorithm for monotone linear complementarity problems (Q353166) (← links)
• An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity (Q410785) (← links)
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones (Q483262) (← links)
• An adaptive infeasible interior-point algorithm for linear complementarity problems (Q743784) (← links)
• A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints (Q812423) (← links)
• A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions (Q858773) (← links)
• A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem (Q890633) (← links)
• A smoothing method for second order cone complementarity problem (Q1019772) (← links)
• Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity (Q1290671) (← links)
• A new approach to continuation methods for complementarity problems with uniform \(P\)-functions (Q1376327) (← links)
• The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem (Q1609708) (← links)
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
• Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood (Q1787924) (← links)
• Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems (Q1894519) (← links)
• Weakening convergence conditions of a potential reduction method for tensor complementarity problems (Q2086932) (← links)
• A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem (Q2175368) (← links)
• Unique end of potential line (Q2194856) (← links)
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems (Q2249820) (← links)
• A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem (Q2249832) (← links)
• On the convergence analysis of arc search interior point methods for LCPs (Q2337791) (← links)
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems (Q2376364) (← links)
• A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems (Q2422131) (← links)
• A representation of the solution set of a class of linear complementarity problems (Q2790881) (← links)
• A full Nesterov–Todd step infeasible-interior-point algorithm for Cartesian<i>P</i>_*(κ) horizontal linear complementarity problems over symmetric cones (Q2790893) (← links)
• A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function (Q2810097) (← links)
• On the<i>P_*(κ)</i>horizontal linear complementarity problems over Cartesian product of symmetric cones (Q2815503) (← links)
• A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity (Q2836103) (← links)
• A full-step interior-point algorithm for linear complementarity problem based on a simple function (Q2903245) (← links)
• An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones (Q2970393) (← links)
• Kernel-function Based Primal-Dual Algorithms for<i>P</i>_{_*}(<i>κ</i>) Linear Complementarity Problems (Q3057529) (← links)
• On Dynamic Multi‐Rigid‐Body Contact Problems with Coulomb Friction (Q4350598) (← links)
• On Dynamic Multi‐Rigid‐Body Contact Problems with Coulomb Friction (Q4352637) (← links)
• Implementation of interior point methods for mixed semidefinite and second order cone optimization problems (Q4405940) (← links)
• THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS (Q4548041) (← links)
• A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs (Q4639138) (← links)
• Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the Cartesian<b><i>P</i></b>_*(κ)-LCP Over Symmetric Cones (Q4979787) (← links)
• On semimonotone star matrices and linear complementarity problem (Q5072466) (← links)
• A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs (Q5241637) (← links)
• Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the Cartesian<i>P</i>_∗(κ)-LCP over symmetric cones (Q5248204) (← links)
• Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation (Q6491339) (← links)