Pages that link to "Item:Q1012072"

The following pages link to Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072):

Displaying 26 items.

• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
• Two new predictor-corrector algorithms for second-order cone programming (Q536560) (← 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)
• A smoothing Newton method for second-order cone optimization based on a new smoothing function (Q648325) (← links)
• A new one-step smoothing Newton method for second-order cone programming. (Q713481) (← links)
• An interior-point algorithm for linear optimization based on a new barrier function (Q720625) (← links)
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862) (← links)
• A polynomial-time interior-point method for circular cone programming based on kernel functions (Q747043) (← links)
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
• A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization (Q1646672) (← links)
• A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization (Q1660297) (← links)
• A full-Newton step interior-point algorithm for linear optimization based on a finite barrier (Q1709950) (← links)
• Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity (Q1782218) (← links)
• Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term (Q2018886) (← links)
• Primal-dual interior-point algorithms for convex quadratic circular cone optimization (Q2353476) (← links)
• Two wide neighborhood interior-point methods for symmetric cone optimization (Q2401022) (← links)
• Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone (Q2405683) (← links)
• A one-parametric class of smoothing functions for second-order cone programming (Q2514078) (← links)
• A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function (Q2817226) (← links)
• A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity (Q2836103) (← links)
• A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS (Q2911579) (← links)
• A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log <i>ϵ</i>⁻¹) iteration complexity (Q3174878) (← 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)