Pages that link to "Item:Q1326510"

The following pages link to Local convergence of interior-point algorithms for degenerate monotone LCP (Q1326510):

Displaying 28 items.

• On the accurate identification of active set for constrained minimax problems (Q531696) (← links)
• Corrector-predictor methods for sufficient linear complementarity problems (Q538303) (← links)
• On the natural merit function for solving complementarity problems (Q647391) (← links)
• New active set identification for general constrained optimization and minimax problems (Q743206) (← links)
• Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems (Q812412) (← links)
• Analyticity of weighted central paths and error bounds for semidefinite programming (Q948959) (← links)
• Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP (Q1264999) (← links)
• Fast convergence of the simplified largest step path following algorithm (Q1361106) (← links)
• On homogeneous and self-dual algorithms for LCP (Q1361111) (← links)
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points (Q1361112) (← links)
• The largest step path following algorithm for monotone linear complementarity problems (Q1363413) (← links)
• Error bounds in mathematical programming (Q1365060) (← links)
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs (Q1380924) (← links)
• The sign-based methods for solving a class of nonlinear complementarity problems (Q1730396) (← links)
• Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem (Q1760104) (← links)
• On the convergence rate of Newton interior-point methods in the absence of strict complementarity (Q1816402) (← links)
• The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path (Q1848380) (← links)
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem (Q1906276) (← links)
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (Q1915906) (← links)
• A path-following interior-point algorithm for linear and quadratic problems (Q1915907) (← links)
• A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence (Q1915908) (← links)
• Newton-type methods for solving quasi-complementarity problems via sign-based equation (Q2424228) (← links)
• Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path (Q2467158) (← links)
• A method for weighted projections to the positive definite cone (Q3453401) (← links)
• Refining the partition for multifold conic optimization problems (Q5151515) (← links)
• Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path (Q5312760) (← links)
• Une procédure de purification pour les problèmes de complémentarité linéaire, monotones (Q5479841) (← links)
• A non-modulus linear method for solving the linear complementarity problem (Q5962835) (← links)