Pages that link to "Item:Q1848379"

The following pages link to A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379):

Displaying 20 items.

• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term (Q432785) (← links)
• A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem (Q606335) (← links)
• A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048) (← links)
• Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function (Q1002309) (← links)
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
• A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions (Q1709428) (← links)
• On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
• The accuracy of interior-point methods based on kernel functions (Q1935292) (← links)
• Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term (Q2018886) (← links)
• A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound (Q2038473) (← links)
• Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization (Q2340161) (← 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)
• An infeasible interior-point algorithm with full-Newton step for linear optimization (Q2464638) (← links)
• Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function (Q2493765) (← links)
• Self-Regular Interior-Point Methods for Semidefinite Optimization (Q2802533) (← links)
• Interior-point methods based on kernel functions for symmetric optimization (Q2885493) (← links)
• AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS (Q3392293) (← 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 of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions (Q6125139) (← links)