Some non-interior path-following methods based on a scaled central path for linear complementarity problems
type: Item
instance of: scholarly article
title: Some non-interior path-following methods based on a scaled central path for linear complementarity problems
zbMATH Open document ID: 1219.90173
author: Wang Qinggang
author: Zhao Jinling
author: Yang Qingzhi
published in: Computational Optimization and Applications
publication date: 2010-05-07T00:00:00Z
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 5705506
zbMATH Keywords: linear complementarity problems with \(P_{0}\) and \(R_{0}\) matrix
zbMATH Keywords: scaled central path
zbMATH Keywords: non-interior path-following methods
zbMATH Keywords: feasible
zbMATH Keywords: infeasible
zbMATH Keywords: global convergence
zbMATH Keywords: local quadratic convergence
MaRDI profile type: Publication
full work available at URL: s10589-008-9188-3
OpenAlex ID: W1996308863
cites work: The global linear convergence of a noninterior path-following algorithm for linear complementarity problems
cites work: Q4252815
cites work: A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
cites work: Complexity of a noninterior path-following method for the linear complementarity problem
cites work: A Non-Interior-Point Continuation Method for Linear Complementarity Problems
cites work: Smooth Approximations to Nonlinear Complementarity Problems
cites work: A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
cites work: Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.
cites work: A class of smoothing functions for nonlinear and mixed complementarity problems
cites work: A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
cites work: Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems
cites work: A complexity bound of a predictor-corrector smoothing method using CHKS-func\-tions for monotone LCP
cites work: The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem
cites work: Some Noninterior Continuation Methods for Linear Complementarity Problems
cites work: Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
cites work: A nonsmooth version of Newton's method
cites work: Q3816922
cites work: Q4252833
cites work: Convergence analysis of Gauss-Newton methods for the complementarity problem
cites work: The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform \(P\)-functions
cites work: A scaled central path for linear programming
cites work: Existence and Limiting Behavior of a Non--Interior-Point Trajectory for Nonlinear Complementarity Problems Without Strict Feasibility Condition
DOI: 10.1007/S10589-008-9188-3
Recommended article: The global linear convergence of a noninterior path-following algorithm for linear complementarity problems
Recommended article: An interior point parameterized central path following algorithm for linearly constrained convex programming
Recommended article: Complexity of a noninterior path-following method for the linear complementarity problem
Recommended article: A central path interior point method for nonlinear programming and its local convergence
Recommended article: A scaled central path for linear programming
Recommended article: Q5309480
Recommended article: Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path
Recommended article: A smoothing Newton method based on a scaled central path for nonlinear complementarity problems
Recommended article: On the central path for nonlinear semidefinite programming
Recommended article: A new path-following algorithm for nonlinear \(P_*\) complementarity problems
description: scientific article; zbMATH DE number 5705506