Pages that link to "Item:Q2773659"

The following pages link to A new and efficient large-update interior-point method for linear optimization (Q2773659):

Displaying 40 items.

• Large-update interior point algorithm for \(P_*\)-linear complementarity problem (Q257756) (← 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)
• On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872) (← links)
• A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← 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)
• An efficient twice parameterized trigonometric kernel function for linear optimization (Q779775) (← links)
• A self-adjusting interior point algorithm for linear complementarity problems (Q814067) (← links)
• Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems (Q979273) (← links)
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
• A full-Newton step interior-point algorithm for linear optimization based on a finite barrier (Q1709950) (← links)
• On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
• The accuracy of interior-point methods based on kernel functions (Q1935292) (← links)
• A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound (Q2038473) (← links)
• Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems (Q2115211) (← links)
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function (Q2245692) (← links)
• A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms (Q2266861) (← links)
• Simplified infeasible interior-point algorithm for linear optimization based on a simple function (Q2294231) (← links)
• Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function (Q2317415) (← links)
• An efficient basis update for asymptotic linear programming (Q2365695) (← links)
• Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function (Q2493765) (← links)
• Two aggregate-function-based algorithms for analysis of 3D frictional contact by linear complementarity problem formulation (Q2494940) (← links)
• An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation (Q2581486) (← links)
• The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function (Q2698611) (← links)
• Generic Primal-dual Interior Point Methods Based on a New Kernel Function (Q3539807) (← links)
• (Q4654839) (← links)
• A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function (Q5009163) (← links)
• A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization (Q5031729) (← links)
• An interior point approach for linear complementarity problem using new parametrized kernel function (Q5055297) (← links)
• Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions (Q5081279) (← links)
• (Q5085900) (← links)
• A new class of infeasible interior-point algorithm for linear complementarity problem (Q5400131) (← 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)
• Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function (Q6189573) (← links)
• A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function (Q6586751) (← links)
• An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming (Q6661713) (← links)
• Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function (Q6662798) (← links)