Pages that link to "Item:Q4441922"
From MaRDI portal
The following pages link to A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier (Q4441922):
Displaying 50 items.
- A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function (Q255679) (← links)
- Large-update interior point algorithm for \(P_*\)-linear complementarity problem (Q257756) (← links)
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
- A full-Newton step interior-point algorithm based on modified Newton direction (Q408387) (← links)
- 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 full-NT-step infeasible interior-point algorithm for SDP based on kernel functions (Q627154) (← links)
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← 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)
- 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)
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function (Q742844) (← links)
- An efficient twice parameterized trigonometric kernel function for linear optimization (Q779775) (← 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)
- 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 primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions (Q1709428) (← links)
- A full-Newton step interior-point algorithm for linear optimization based on a finite barrier (Q1709950) (← links)
- Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term (Q1730836) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q1928163) (← links)
- The accuracy of interior-point methods based on kernel functions (Q1935292) (← links)
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier (Q1935397) (← links)
- An efficient parameterized logarithmic kernel function for semidefinite optimization (Q2023749) (← links)
- A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions (Q2062428) (← links)
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems (Q2115211) (← links)
- A generic kernel function for interior point methods (Q2245691) (← links)
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function (Q2245692) (← links)
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function (Q2252687) (← links)
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms (Q2266861) (← links)
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term (Q2303523) (← links)
- A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions (Q2316302) (← links)
- Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function (Q2317415) (← links)
- Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization (Q2340161) (← links)
- An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function (Q2346488) (← links)
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems (Q2356344) (← 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)
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions (Q2442632) (← links)
- A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization (Q2795090) (← links)
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function (Q2817226) (← links)
- Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization (Q2841915) (← links)
- A new infeasible interior-point algorithm with full step for linear optimization based on a simple function (Q2885543) (← links)
- A full-step interior-point algorithm for linear complementarity problem based on a simple function (Q2903245) (← links)
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362) (← links)
- A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION (Q2996870) (← links)
- Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function (Q3051677) (← links)
