Pages that link to "Item:Q4651997"

The following pages link to A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization (Q4651997):

Displaying 50 items.

• Large-update interior point algorithm for \(P_*\)-linear complementarity problem (Q257756) (← links)
• A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function (Q290328) (← links)
• An efficient fifth-order method for linear optimization (Q306315) (← links)
• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term (Q306399) (← links)
• Infeasible interior-point methods for linear optimization based on large neighborhood (Q306402) (← links)
• Derivatives of eigenvalues and Jordan frames (Q317127) (← links)
• A polynomial interior-point algorithm for monotone linear complementarity problems (Q353166) (← links)
• A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems (Q353550) (← links)
• New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems (Q383382) (← links)
• A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
• Kernel function based interior-point methods for horizontal linear complementarity problems (Q394593) (← links)
• A full-Newton step interior-point algorithm based on modified Newton direction (Q408387) (← links)
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← links)
• An adaptive-step primal-dual interior point algorithm for linear optimization (Q425813) (← links)
• On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872) (← links)
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term (Q432785) (← links)
• Full-NT step infeasible interior-point method for SOCO based on a specific kernel function (Q471570) (← links)
• A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function (Q483254) (← links)
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones (Q483262) (← links)
• New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP (Q497434) (← links)
• An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term (Q513522) (← links)
• Interior point algorithm for \(P_*\) nonlinear complementarity problems (Q544204) (← links)
• A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem (Q606335) (← 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)
• New parameterized kernel functions for linear optimization (Q693134) (← 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)
• New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
• Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem (Q732130) (← links)
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862) (← links)
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
• Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function (Q742844) (← links)
• A polynomial-time interior-point method for circular cone programming based on kernel functions (Q747043) (← links)
• An efficient twice parameterized trigonometric kernel function for linear optimization (Q779775) (← links)
• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function (Q843962) (← 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)
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization (Q923998) (← links)
• A polynomial-time algorithm for linear optimization based on a new class of kernel functions (Q1002187) (← links)
• Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function (Q1002309) (← links)
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization (Q1014009) (← links)
• A new primal-dual path-following interior-point algorithm for semidefinite optimization (Q1014697) (← links)
• A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem (Q1633334) (← links)
• An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function (Q1677001) (← links)
• A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm (Q1689710) (← links)