The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems

Authors:
James V. Burke;Song Xu
Affiliations:
-;-
Venue:
Mathematics of Operations Research
Year:
1998

Citing 0
Cited 25

Smoothing functions and smoothing Newton method for complementarity and variational inequality problems

Journal of Optimization Theory and Applications
Complexity of a noninterior path-following method for the linear complementarity problem

Journal of Optimization Theory and Applications
A Complexity Analysis of a Smoothing Method Using CHKS-functions for Monotone Linear Complementarity Problems

Computational Optimization and Applications
A Smoothing Newton Method for General Nonlinear Complementarity Problems

Computational Optimization and Applications
A Global Linear and Local Quadratic Continuation Smoothing Method for Variational Inequalities with Box Constraints

Computational Optimization and Applications
Smoothing Method for Minimax Problems

Computational Optimization and Applications
A Complexity Bound of a Predictor-Corrector Smoothing Method Using CHKS-Functions for Monotone LCP

Computational Optimization and Applications
Quadratic one-step smoothing Newton method for P0-LCP without strict complementarity

Applied Mathematics and Computation
Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems

Computational Optimization and Applications
A Non-Interior Path Following Method for Convex Quadratic Programming Problems with Bound Constraints

Computational Optimization and Applications
Applications of smoothing methods in numerical analysis and optimization

Focus on computational neurobiology
On the Finite Termination of an Entropy Function Based Non-Interior Continuation Method for Vertical Linear Complementarity Problems

Journal of Global Optimization
A New Path-Following Algorithm for Nonlinear P*Complementarity Problems

Computational Optimization and Applications
Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem

Applied Mathematics and Computation
A smoothing-type algorithm for solving system of inequalities

Journal of Computational and Applied Mathematics
A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems

Optimization Methods & Software
A self-adjusting interior point algorithm for linear complementarity problems

Computers & Mathematics with Applications
Some non-interior path-following methods based on a scaled central path for linear complementarity problems

Computational Optimization and Applications
A new smoothing and regularization Newton method for P0-NCP

Journal of Global Optimization
A non-interior continuation algorithm for the CP based on a generalized smoothing function

Journal of Computational and Applied Mathematics
A new smoothing Broyden-like method for solving nonlinear complementarity problem with a P0-function

Journal of Global Optimization
A full-Newton step non-interior continuation algorithm for a class of complementarity problems

Journal of Computational and Applied Mathematics
A continuation method for the linear second-order cone complementarity problem

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Sufficient conditions on nonemptiness and boundedness of the solution set of the P0 function nonlinear complementarity problem

Operations Research Letters
A fixed-point method for a class of super-large scale nonlinear complementarity problems

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A noninterior path-following algorithm is proposed for the linear complementarity problem. The method employs smoothing techniques introduced by Kanzow. If the LCP is P0 + R0 and satisfies a nondegeneracy condition due to Fukushima, Luo, and Pang, then the algorithm is globally linearly convergent. As with interior point path-following methods, the convergence theory relies on the notion of a neighborhood for the central path. However, the choice of neighborhood differs significantly from that which appears in the interior point literature. Numerical experiments are presented that illustrate the significance of the neighborhood concept for this class of methods.