The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform \(P\)-functions
From MaRDI portal
Publication:1575072
DOI10.1007/s101070050009zbMath0989.90125OpenAlexW68594018MaRDI QIDQ1575072
Publication date: 14 August 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050009
interior-point methodpath followingcomplementarity problemsnon-interior-point methoduniform \(P\)-function
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
A global linear and local superlinear (quadratic) inexact non-interior continuation method for variational inequalities over general closed convex sets, A modified feasible semi-smooth asymptotically Newton method for nonlinear complementarity problems, A modified Broyden-like method for nonlinear complementarity problems, A regularized smoothing Newton method for solving SOCCPs based on a new smoothing C-function, A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics, Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity problem, Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function, The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function, A new smoothing Broyden-like method for solving nonlinear complementarity problem with a \(P_{0}\)-function, Nonsmooth Levenberg-Marquardt type method for solving a class of stochastic linear complementarity problems with finitely many elements, A polynomial path following algorithm for convex programming, Inexact non-interior continuation method for monotone semidefinite complementarity problems, Some non-interior path-following methods based on a scaled central path for linear complementarity problems, A new smoothing and regularization Newton method for \(P_{0}\)-NCP, Complexity of a noninterior path-following method for the linear complementarity problem, Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems, A globally convergent interior point algorithm for non-convex nonlinear programming, NON-INTERIOR CONTINUATION METHOD FOR COMPLEMENTARITY PROBLEMS IN ABSENCE OF STRICT COMPLEMENTARITY, Inexact non-interior continuation method for solving large-scale monotone SDCP, An exterior point polynomial-time algorithm for convex quadratic programming
Uses Software
