A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
From MaRDI portal
Publication:4651997
DOI10.1137/S1052623403423114zbMath1077.90038OpenAlexW1996119919MaRDI QIDQ4651997
Cornelis Roos, M. El Ghami, Yan-Qin Bai
Publication date: 23 February 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623403423114
Linear programming (90C05) Interior-point methods (90C51) Complexity and performance of numerical algorithms (65Y20)
Related Items
An efficient logarithmic barrier method without line search for convex quadratic programming, Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, An interior point approach for linear complementarity problem using new parametrized kernel function, Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function, 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 POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS, A corrector–predictor path-following algorithm for semidefinite optimization, 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, Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions, An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function, Complexity analysis of interior point methods for linear programming based on a parameterized kernel function, A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods, Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term, A step-truncated method in a wide neighborhood interior-point algorithm for linear programming, Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term, Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions, A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function, Interior-point algorithm for linear programming based on a new descent direction, Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations, Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function, A full NT-step infeasible interior-point algorithm for semidefinite optimization, A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization, Generic Primal-dual Interior Point Methods Based on a New Kernel Function, A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION, A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions, A new class of infeasible interior-point algorithm for linear complementarity problem, Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term, A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP, A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function, Interior-point algorithm based on general kernel function for monotone linear complementarity problem, Penalized interior point approach for constrained nonlinear programming, A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION, A self-concordant exponential kernel function for primal–dual interior-point algorithm, A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions, Unnamed Item, 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, An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function, Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions, Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming, Unnamed Item, Kernel-function Based Algorithms for Semidefinite Optimization, A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization, A primal-dual interior-point method based on a new kernel function for linear complementarity problem, A class of polynomial primal-dual interior-point algorithms for semidefinite optimization, Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function, A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function, 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, 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 path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function, A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem, A full-step interior-point algorithm for linear complementarity problem based on a simple function, An efficient fifth-order method for linear optimization, An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term, Infeasible interior-point methods for linear optimization based on large neighborhood, A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function, Derivatives of eigenvalues and Jordan frames, A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions, 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, Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone, 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, An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function, 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, A large-update 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 infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem, 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 parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm, 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, A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions, 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, 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, Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term, New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP, The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function, A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions, Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones, Primal-dual interior-point algorithm for convex quadratic semi-definite optimization, An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization, Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term, Full-NT step infeasible interior-point method for SOCO based on a specific kernel function, Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term, A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function, A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones, Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function, Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems, New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP, An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term, A generic kernel function for interior point methods, A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function, Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function, Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function, 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, A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems, Interior point algorithm for \(P_*\) nonlinear complementarity problems, On self-regular IPMs (with comments and rejoinder), A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms, A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization, Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term, An efficient parameterized logarithmic kernel function for semidefinite optimization, An interior-point algorithm for linear optimization based on a new barrier function, Interior-point algorithm for linear optimization based on a new trigonometric kernel function, An efficient parameterized logarithmic kernel function for linear optimization, New method for determining search directions for interior-point algorithms in linear optimization, A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions, Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem, A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound, 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, 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, Simplified infeasible interior-point algorithm for linear optimization based on a simple function, Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem, Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity 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, A polynomial-time interior-point method for circular cone programming based on kernel functions, A wide neighborhood interior-point algorithm based on the trigonometric kernel function, An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function, A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function, An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term, An interior-point algorithm for linear programming with optimal selection of centering parameter and step size, A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions, Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique, Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization, An efficient twice parameterized trigonometric kernel function for linear optimization, Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization, Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function, An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function, A MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION, Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term, Primal-dual interior-point algorithms for convex quadratic circular cone optimization, Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems, Large-update interior point algorithm for \(P_*\)-linear complementarity problem, A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
