Predictor-corrector smoothing methods for monotone LCP

DOI10.1007/S10255-004-0193-8MaRDI QIDQ705035zbMATH OpenOpenAlexFDO

Authors Yongmei Su, Ju-liang Zhang, Xiangsun Zhang

Publication date 25 January 2005

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10255-004-0193-8

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 1306969
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
• A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
• A complexity bound of a predictor-corrector smoothing method using CHKS-func\-tions for monotone LCP
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP

Cites work

• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• 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
• A Non-Interior-Point Continuation Method for Linear Complementarity Problems
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
• A nonsmooth version of Newton's method
• Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
• Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems
• Improved smoothing-type methods for the solution of linear programs
• On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
• Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter
• Smoothing methods for convex inequalities and linear complementarity problems
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• Some continuity properties of polyhedral multifunctions
• Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.
• The global linear convergence of a noninterior path-following algorithm for linear complementarity problems

Cited in

(2)

• A complexity bound of a predictor-corrector smoothing method using CHKS-func\-tions for monotone LCP
• On Sum Decompositions of Weighted Least-Squares Estimators for the Partitioned Linear Model

This page was built for publication: Predictor-corrector smoothing methods for monotone LCP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705035)