A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution

DOI10.1080/10556780600627727zbMath1113.90158OpenAlexW1973443234MaRDI QIDQ5481687

Zheng-Hai Huang, Jie Sun

Publication date: 10 August 2006

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780600627727

zbMATH Keywords

linear complementarity problemsmoothing methodfinite terminationsufficient matrixmaximally complementary solution

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

An inexact smoothing method for the monotone complementarity problem over symmetric cones, A smoothing Newton algorithm for weighted linear complementarity problem, Smoothing Newton method for generalized complementarity problems based on a new smoothing function, Finite termination of a Newton-type algorithm for a class of affine variational inequality problems, Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem, Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem, A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties, A revised cut-peak function method for box constrained continuous global optimization, Column sufficient tensors and tensor complementarity problems, On sufficient properties of sufficient matrices, Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem, On column competent matrices and linear complementarity problem

Cites Work

• On the finite convergence of interior-point algorithms for linear programming
• Finding an interior point in the optimal face of linear programs
• Improved smoothing-type methods for the solution of linear programs
• A comparison of large scale mixed complementarity problem solvers
• Error bounds in mathematical programming
• Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
• Identification of the optimal active set in a noninterior continuation method for LCP
• The reformulation of nonlinear complementarity problems using the Fischer-Burmeister function
• A class of smoothing functions for nonlinear and mixed complementarity problems
• Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter
• Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem
• Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
• A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
• On Smoothing Methods for the P₀ Matrix Linear Complementarity Problem
• The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
• A Non-Interior-Point Continuation Method for Linear Complementarity Problems
• Some continuity properties of polyhedral multifunctions
• On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
• A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P₀LCPs
• A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
• A Global and Local Superlinear Continuation-Smoothing Method forP₀andR₀NCP or Monotone NCP
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• Approximations to Solutions to Systems of Linear Inequalities