Pages that link to "Item:Q1849264"

The following pages link to Self-regular functions and new search directions for linear and semidefinite optimization (Q1849264):

Displaying 29 items.

• General primal-dual penalty/barrier path-following Newton methods for nonlinear programming (Q3534650) (← links)
• Generic Primal-dual Interior Point Methods Based on a New Kernel Function (Q3539807) (← links)
• Interior-point algorithm based on general kernel function for monotone linear complementarity problem (Q3572642) (← links)
• A primal‐dual interior-point method for linear optimization based on a new proximity function (Q4405935) (← links)
• A dynamic large-update primal‐dual interior-point method for linear optimization (Q4405939) (← links)
• Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term (Q4596180) (← links)
• A full NT-step infeasible interior-point algorithm for semidefinite optimization (Q4603922) (← links)
• A polynomial-time algorithm for linear optimization based on a new simple kernel function (Q4650623) (← links)
• An interior point method for linear programming based on a class of Kernel functions (Q4654260) (← links)
• A self-adjusting primal–dual interior point method for linear programs (Q4657821) (← links)
• (Q4915359) (← links)
• A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization (Q5031729) (← links)
• Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions (Q5081279) (← links)
• (Q5085900) (← links)
• A self-concordant exponential kernel function for primal–dual interior-point algorithm (Q5169467) (← links)
• A primal-dual interior-point method based on a new kernel function for linear complementarity problem (Q5243687) (← links)
• A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function (Q5299916) (← links)
• An adaptive self-regular proximity-based large-update IPM for LO (Q5312761) (← links)
• Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization (Q5320239) (← links)
• A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function (Q5356999) (← 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 second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function (Q6158944) (← links)
• A new search direction for full-Newton step infeasible interior-point method in linear optimization (Q6202360) (← links)
• A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem (Q6492455) (← links)
• A polynomial interior-point algorithm with improved iteration bounds for linear optimization (Q6498419) (← 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)
• Kernel-based full-Newton step feasible interior-point algorithm for \(P_* (\kappa)\)-weighted linear complementarity problem (Q6596330) (← links)
• Dislocation hyperbolic kernel function (Q6620698) (← links)
• An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming (Q6661713) (← links)