A full-step interior-point algorithm for linear complementarity problem based on a simple function

DOI10.1080/02522667.2011.10700121zbMath1244.90229MaRDI QIDQ2903245

Yinghong Xu, Lipu Zhang

Publication date: 8 August 2012

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: http://www.connectjournals.com/file_html_pdf/1268706H_05_JIOS_T108_32-6_pp1315-1332a.pdf

zbMATH Keywords

linear complementarity problems; complexity analysis; interior-point algorithm

Mathematics Subject Classification ID

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

90C51: Interior-point methods

Related Items

An extension for identifying search directions for interior-point methods in linear optimization, A polynomial-time weighted path-following interior-point algorithm for linear optimization, A primal-dual interior-point method based on a new kernel function for linear complementarity problem

Cites Work

• Unnamed Item
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A polynomial-time algorithm for a class of linear complementarity problems
• A unified approach to interior point algorithms for linear complementary problems
• Interior point methods of mathematical programming
• Self-regular functions and new search directions for linear and semidefinite optimization
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• Homotopy Continuation Methods for Nonlinear Complementarity Problems
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• 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
• New complexity analysis of the primal-dual Newton method for linear optimization