New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
type: Item
instance of: scholarly article
title: New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
zbMATH Open document ID: 1331.90085
author: Yong-Cai Geng
author: Sumit K. Garg
published in: Optimization Letters
publication date: 2015-09-24T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6484979
zbMATH Keywords: interior-point methods
zbMATH Keywords: \(P_\ast(\kappa)\)-matrix
zbMATH Keywords: linear complementarity problem
zbMATH Keywords: full-Newton step
zbMATH Keywords: polynomial complexity
MaRDI profile type: Publication
full work available at URL: s11590-014-0800-4
OpenAlex ID: W1971375329
cites work: Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
cites work: An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
cites work: Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
cites work: A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
cites work: Q3415802
cites work: Engineering and Economic Applications of Complementarity Problems
cites work: A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
cites work: A polynomial interior-point algorithm for monotone linear complementarity problems
cites work: A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
cites work: An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
cites work: Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
cites work: Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
cites work: A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
cites work: Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
cites work: A full-Newton step interior-point algorithm based on modified Newton direction
DOI: 10.1007/S11590-014-0800-4
description: scientific article; zbMATH DE number 6484979