A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods

DOI10.1016/J.CAM.2010.12.012MaRDI QIDQ631897zbMATH OpenOpenAlexFDO

Authors Liying Liu, Shaoyong Li

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

zbMATH Keywords

kernel functionlarge-update methods

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A generic kernel function for interior point methods
• A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
• A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
• Generic Primal-dual Interior Point Methods Based on a New Kernel Function
• Primal-dual interior-point algorithm for LO based on a new kernel function

Cites work

• scientific article; zbMATH DE number 3972641 (Why is no real title available?)
• scientific article; zbMATH DE number 4126998 (Why is no real title available?)
• scientific article; zbMATH DE number 1047679 (Why is no real title available?)
• scientific article; zbMATH DE number 1862745 (Why is no real title available?)
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
• A matrix-splitting method for symmetric affine second-order cone complementarity problems
• A new and efficient large-update interior-point method for linear optimization
• A new class of polynomial interior-point algorithms for \(P_*(\kappa)\)-linear complementary problems
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
• A new polynomial-time algorithm for linear programming
• A new primal-dual path-following method for convex quadratic programming
• A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
• A polynomial-time algorithm for linear optimization based on a new class of kernel functions
• A polynomial-time algorithm for linear optimization based on a new simple kernel function
• A smoothing Gauss-Newton method for the generalized HLCP
• Engineering and Economic Applications of Complementarity Problems
• Fast convergence of the simplified largest step path following algorithm
• Finding an interior point in the optimal face of linear programs
• Global convergence enhancement of classical linesearch interior point methods for MCPs
• Interior-point methods
• New complexity analysis of the primal-dual Newton method for linear optimization
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• On the finite convergence of interior-point algorithms for linear programming
• Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
• Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
• Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming
• Primal-dual target-following algorithms for linear programming
• Self-regular functions and new search directions for linear and semidefinite optimization
• The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function

Cited in

(5)

• A generic kernel function for interior point methods
• Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
• Using vector divisions in solving the linear complementarity problem
• An efficient parameterized logarithmic kernel function for semidefinite optimization
• An efficient fifth-order method for linear optimization

This page was built for publication: A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631897)