A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem

From MaRDI portal
Revision as of 16:38, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1970299

DOI10.1007/S101079900111zbMath1081.90603OpenAlexW1544526981MaRDI QIDQ1970299

Jim Burke, Song Xu

Publication date: 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101079900111




Related Items (34)

Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems.A non-interior continuation algorithm for solving the convex feasibility problemA predictor-corrector smoothing method for second-order cone programmingA new path-following algorithm for nonlinear \(P_*\) complementarity problemsA smoothing Newton method for the second-order cone complementarity problem.Convergence of a non-interior continuation algorithm for the monotone SCCPA novel non-linear approach to minimal area rectangular packingSolvability of Newton equations in smoothing-type algorithms for the SOCCPA non-interior continuation algorithm for the CP based on a generalized smoothing functionQuadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity.Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functionsPredictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) functionAn entire space polynomial-time algorithm for linear programmingConvergence of a smoothing-type algorithm for the monotone affine variational inequality problemAnalysis of a non-interior continuation method for second-order cone programmingFormulating an \(n\)-person noncooperative game as a tensor complementarity problemThe asymptotic Browder Hartman Stampacchia condition and interior bands of \(\varepsilon\)-solutions for nonlinear complementarity problemsA smoothing-type algorithm for solving linear complementarity problems with strong convergence propertiesSuperlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.Inexact non-interior continuation method for monotone semidefinite complementarity problemsSmoothing algorithms for complementarity problems over symmetric conesSome non-interior path-following methods based on a scaled central path for linear complementarity problemsA smoothing Gauss-Newton method for the generalized HLCPPredictor-corrector smoothing methods for monotone LCPSmoothing-type algorithm for solving linear programs by using an augmented complementarity problemTensor complementarity problems. II: Solution methodsA smoothing Levenberg-Marquardt method for NCPComplexity of a noninterior path-following method for the linear complementarity problemImproving the convergence of non-interior point algorithms for nonlinear complementarity problemsA nonmonotone smoothing Newton algorithm for weighted complementarity problemFinite termination of a smoothing-type algorithm for the monotone affine variational inequality problemA smoothing Newton method with a mixed line search for monotone weighted complementarity problemsAn exterior point polynomial-time algorithm for convex quadratic programmingAn interior point parameterized central path following algorithm for linearly constrained convex programming







This page was built for publication: A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem