Pages that link to "Item:Q1014009"

The following pages link to A class of large-update and small-update primal-dual interior-point algorithms for linear optimization (Q1014009):

Displaying 27 items.

• A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems (Q353550) (← links)
• A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← links)
• New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP (Q497434) (← links)
• A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem (Q607084) (← links)
• A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
• A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734) (← links)
• Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048) (← links)
• An interior-point algorithm for linear optimization based on a new barrier function (Q720625) (← links)
• An efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← links)
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization (Q923998) (← links)
• Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems (Q979273) (← links)
• A new primal-dual path-following interior-point algorithm for semidefinite optimization (Q1014697) (← links)
• Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term (Q1724788) (← links)
• Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood (Q1787924) (← links)
• The accuracy of interior-point methods based on kernel functions (Q1935292) (← links)
• An efficient parameterized logarithmic kernel function for semidefinite optimization (Q2023749) (← links)
• Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem (Q2044578) (← links)
• A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds (Q2361520) (← links)
• Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone (Q2405683) (← links)
• Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362) (← links)
• A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION (Q2996870) (← links)
• Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term (Q6107947) (← links)
• A step-truncated method in a wide neighborhood interior-point algorithm for linear programming (Q6110633) (← links)
• A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation (Q6166934) (← links)
• A polynomial interior-point algorithm with improved iteration bounds for linear optimization (Q6498419) (← links)