A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
From MaRDI portal
Publication:1970299
DOI10.1007/S101079900111zbMath1081.90603OpenAlexW1544526981MaRDI QIDQ1970299
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 problem ⋮ A predictor-corrector smoothing method for second-order cone programming ⋮ A new path-following algorithm for nonlinear \(P_*\) complementarity problems ⋮ A smoothing Newton method for the second-order cone complementarity problem. ⋮ Convergence of a non-interior continuation algorithm for the monotone SCCP ⋮ A novel non-linear approach to minimal area rectangular packing ⋮ Solvability of Newton equations in smoothing-type algorithms for the SOCCP ⋮ A non-interior continuation algorithm for the CP based on a generalized smoothing function ⋮ Quadratic 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 functions ⋮ Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function ⋮ An entire space polynomial-time algorithm for linear programming ⋮ Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem ⋮ Analysis of a non-interior continuation method for second-order cone programming ⋮ Formulating an \(n\)-person noncooperative game as a tensor complementarity problem ⋮ The asymptotic Browder Hartman Stampacchia condition and interior bands of \(\varepsilon\)-solutions for nonlinear complementarity problems ⋮ A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties ⋮ Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity. ⋮ Inexact non-interior continuation method for monotone semidefinite complementarity problems ⋮ Smoothing algorithms for complementarity problems over symmetric cones ⋮ Some non-interior path-following methods based on a scaled central path for linear complementarity problems ⋮ A smoothing Gauss-Newton method for the generalized HLCP ⋮ Predictor-corrector smoothing methods for monotone LCP ⋮ Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem ⋮ Tensor complementarity problems. II: Solution methods ⋮ A smoothing Levenberg-Marquardt method for NCP ⋮ Complexity of a noninterior path-following method for the linear complementarity problem ⋮ Improving the convergence of non-interior point algorithms for nonlinear complementarity problems ⋮ A nonmonotone smoothing Newton algorithm for weighted complementarity problem ⋮ Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem ⋮ A smoothing Newton method with a mixed line search for monotone weighted complementarity problems ⋮ An exterior point polynomial-time algorithm for convex quadratic programming ⋮ An 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