A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
From MaRDI portal
Publication:631897
DOI10.1016/j.cam.2010.12.012zbMath1211.90288OpenAlexW2084309945MaRDI QIDQ631897
Publication date: 14 March 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.12.012
Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
An efficient fifth-order method for linear optimization, Using vector divisions in solving the linear complementarity problem, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new primal-dual path-following method for convex quadratic programming
- On the finite convergence of interior-point algorithms for linear programming
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- 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
- Finding an interior point in the optimal face of linear programs
- Fast convergence of the simplified largest step path following algorithm
- Interior-point methods
- A matrix-splitting method for symmetric affine second-order cone complementarity problems
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- Self-regular functions and new search directions for linear and semidefinite optimization
- Global convergence enhancement of classical linesearch interior point methods for MCPs
- Primal-dual target-following algorithms for linear programming
- Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
- The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming
- A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Engineering and Economic Applications of Complementarity Problems
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A polynomial-time algorithm for linear optimization based on a new simple kernel function
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- New complexity analysis of the primal-dual Newton method for linear optimization
- A smoothing Gauss-Newton method for the generalized HLCP
