A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
From MaRDI portal
Publication:4441922
DOI10.1137/S1052623401398132zbMath1036.90051OpenAlexW2059947385MaRDI QIDQ4441922
M. El Ghami, Cornelis Roos, Yan-Qin Bai
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623401398132
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Interior-point methods (90C51)
Related Items
A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization, 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, 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, Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions, A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function, 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, A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem, 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, 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, Complexity analysis of interior point methods for linear programming based on a parameterized kernel function, A full-Newton step interior-point algorithm based on modified Newton direction, A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods, 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, A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions, A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods, A new search direction for full-Newton step infeasible interior-point method in linear optimization, Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term, A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions, A full-Newton step interior-point algorithm for linear optimization based on a finite barrier, Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions, Generic Primal-dual Interior Point Methods Based on a New Kernel Function, Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term, 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 generic kernel function for interior point methods, A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function, Interior-point algorithm based on general kernel function for monotone linear complementarity problem, An interior point method for linear programming based on a class of Kernel functions, 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 primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions, On self-regular IPMs (with comments and rejoinder), A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms, Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function, An efficient parameterized logarithmic kernel function for semidefinite optimization, An interior-point algorithm for linear optimization based on a new barrier function, Kernel-function Based Primal-Dual Algorithms forP*(κ) Linear Complementarity Problems, New method for determining search directions for interior-point algorithms in linear optimization, A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization, Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem, 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 with dynamic step-size based on kernel functions for linear programming, A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function, 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 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 APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS, A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions, A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions, Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function, 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, A primal-dual interior-point method based on a new kernel function for linear complementarity problem, Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization, An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function, Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems, A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function, 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
