A new class of polynomial primal-dual methods for linear and semidefinite optimization
From MaRDI portal
Publication:1848379
DOI10.1016/S0377-2217(02)00275-8zbMath1058.90037OpenAlexW1969136247MaRDI QIDQ1848379
Jiming Peng, Cornelis Roos, Tamás Terlaky
Publication date: 20 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00275-8
Linear optimizationInterior point methodPolynomialcomplexityPrimal-dual Newton methodSemidefinite optimization
Related Items (25)
Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier ⋮ 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 ⋮ Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions ⋮ A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem ⋮ 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 of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods ⋮ 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 ⋮ Generic Primal-dual Interior Point Methods Based on a New Kernel Function ⋮ An infeasible interior-point algorithm with full-Newton step for linear optimization ⋮ An interior point method for linear programming based on a class of Kernel functions ⋮ Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term ⋮ On self-regular IPMs (with comments and rejoinder) ⋮ A primal‐dual interior-point method for linear optimization based on a new proximity function ⋮ Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function ⋮ Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term ⋮ A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound ⋮ Self-Regular Interior-Point Methods for Semidefinite Optimization ⋮ Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function ⋮ An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming ⋮ AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS ⋮ Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the finite convergence of interior-point algorithms for linear programming
- A new polynomial-time algorithm for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Symmetric primal-dual path-following algorithms for semidefinite programming
- Finding an interior point in the optimal face of linear programs
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- Primal-dual algorithms for linear programming based on the logarithmic barrier method
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- On the Implementation of a Primal-Dual Interior Point Method
- On the Nesterov--Todd Direction in Semidefinite Programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
- New complexity analysis of the primal-dual Newton method for linear optimization
This page was built for publication: A new class of polynomial primal-dual methods for linear and semidefinite optimization
