scientific article
From MaRDI portal
Publication:2773659
zbMath0987.90089MaRDI QIDQ2773659
Tamás Terlaky, Cornelis Roos, Jiming Peng
Publication date: 24 February 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization, Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, 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, An interior point approach for linear complementarity problem using new parametrized kernel function, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions, The accuracy of interior-point methods based on kernel functions, Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term, Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function, 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, The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function, A full-Newton step interior-point algorithm for linear optimization based on a finite barrier, Generic Primal-dual Interior Point Methods Based on a New Kernel Function, A new class of infeasible interior-point algorithm for linear complementarity problem, A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function, On self-regular IPMs (with comments and rejoinder), A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms, Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function, Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems, Two aggregate-function-based algorithms for analysis of 3D frictional contact by linear complementarity problem formulation, Unnamed Item, An efficient parameterized logarithmic kernel function for linear optimization, A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound, Simplified infeasible interior-point algorithm for linear optimization based on a simple function, Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions, Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function, An efficient twice parameterized trigonometric kernel function for linear optimization, A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function, An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation, Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems, A self-adjusting interior point algorithm for linear complementarity problems
