Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem

DOI10.1016/j.cam.2009.07.014zbMath1183.65072OpenAlexW1979376655MaRDI QIDQ732130

Yan-Qin Bai, Guo-Qiang Wang

Publication date: 9 October 2009

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.2009.07.014

zbMATH Keywords

algorithmsnumerical exampleskernel functioninterior-point methodshorizontal linear complementarity problemiteration bounds

Mathematics Subject Classification ID

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

Related Items

A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function ⋮ Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems ⋮ An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path ⋮ An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function ⋮ Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP ⋮ An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function ⋮ A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem ⋮ Kernel function based interior-point methods for horizontal linear complementarity problems ⋮ A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems ⋮ The relaxation modulus-based matrix splitting iteration method for horizontal linear complementarity problems ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones ⋮ Using vector divisions in solving the linear complementarity problem ⋮ New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP ⋮ A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions ⋮ A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP ⋮ A Corrector-Predictor Interior-Point Algorithm for P_∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones ⋮ New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP ⋮ An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term ⋮ A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems ⋮ A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem ⋮ A Mehrotra type predictor-corrector interior-point algorithm for linear programming ⋮ A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP_*(κ) horizontal linear complementarity problems over symmetric cones ⋮ Complexity analysis of a weighted-full-Newton step interior-point algorithm forP_∗(κ)-LCP ⋮ Dictionary learning for fast classification based on soft-thresholding ⋮ An adaptive infeasible interior-point algorithm for linear complementarity problems ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function ⋮ A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions ⋮ A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems ⋮ Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization ⋮ An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function ⋮ Two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems ⋮ A relaxation two-sweep modulus-based matrix splitting iteration method for horizontal linear complementarity problems ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial-time algorithm for linear optimization based on a new class of kernel functions
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Fast convergence of the simplified largest step path following algorithm
• The largest step path following algorithm for monotone linear complementarity problems
• Interior-point methods
• A matrix-splitting method for symmetric affine second-order cone complementarity problems
• 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 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
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
• Equivaence between different formulations of the linear complementarity promblem
• Engineering and Economic Applications of Complementarity Problems
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• Complementarity problems
• A smoothing Gauss-Newton method for the generalized HLCP

This page was built for publication: Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem