A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
From MaRDI portal
Publication:4651997
DOI10.1137/S1052623403423114zbMath1077.90038MaRDI QIDQ4651997
Cornelis Roos, Yan-Qin Bai, M. El Ghami
Publication date: 23 February 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
interior-point method; primal-dual method; linear optimization; polynomial complexity; large-update method
90C05: Linear programming
90C51: Interior-point methods
65Y20: Complexity and performance of numerical algorithms
Related Items
Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions, Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions, Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP, A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function, A new primal-dual interior-point algorithm for convex quadratic optimization, Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization, A new class of infeasible interior-point algorithm for linear complementarity problem, A polynomial interior-point algorithm for monotone linear complementarity problems, A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems, New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems, A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function, Kernel function based interior-point methods for horizontal linear complementarity problems, A full-Newton step interior-point algorithm based on modified Newton direction, A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, An adaptive-step primal-dual interior point algorithm for linear optimization, On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function, Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term, Interior point algorithm for \(P_*\) nonlinear complementarity problems, A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem, A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem, A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods, A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones, New parameterized kernel functions for linear optimization, Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term, An interior-point algorithm for linear optimization based on a new barrier function, Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem, A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function, A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions, Primal-dual interior-point algorithm for convex quadratic semi-definite optimization, A polynomial-time algorithm for linear optimization based on a new class of kernel functions, Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function, Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions, A class of large-update and small-update primal-dual interior-point algorithms for linear optimization, A new primal-dual path-following interior-point algorithm for semidefinite optimization, On self-regular IPMs (with comments and rejoinder), A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function, The accuracy of interior-point methods based on kernel functions, Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier, A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms, New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP, Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions, Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems, Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function, A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems, Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function, Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization, A MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION, Interior-point methods based on kernel functions for symmetric optimization, A new infeasible interior-point algorithm with full step for linear optimization based on a simple function, A full-step interior-point algorithm for linear complementarity problem based on a simple function, A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS, A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION, Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function, Kernel-function Based Primal-Dual Algorithms forP*(κ) Linear Complementarity Problems, A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization, Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming, A class of polynomial primal-dual interior-point algorithms for semidefinite optimization, A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods, Generic Primal-dual Interior Point Methods Based on a New Kernel Function, Interior-point algorithm based on general kernel function for monotone linear complementarity problem, Penalized interior point approach for constrained nonlinear programming, Kernel-function Based Algorithms for Semidefinite Optimization, A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
