Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems

DOI10.1287/moor.15.4.662zbMath0719.90085OpenAlexW2059352176MaRDI QIDQ5752302

Shinji Mizuno, Kojima, Masakazu, Toshihito Noma

Publication date: 1990

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.15.4.662

zbMATH Keywords

complementarity problemlimiting behavior

Mathematics Subject Classification ID

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

Related Items (25)

Analysis of some interior point continuous trajectories for convex programming ⋮ A globally convergent primal-dual interior point algorithm for convex programming ⋮ Some properties of generalized proximal point methods for quadratic and linear programming ⋮ THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS ⋮ A new path-following algorithm for nonlinear \(P_*\) complementarity problems ⋮ Trajectory-following methods for large-scale degenerate convex quadratic programming ⋮ A continuation method for monotone variational inequalities ⋮ Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems ⋮ A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems ⋮ A new approach to continuation methods for complementarity problems with uniform \(P\)-functions ⋮ Interior-point methods for nonlinear complementarity problems ⋮ Novel approaches to the discrimination problem ⋮ The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function ⋮ The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra ⋮ The Convergent Generalized Central Paths for Linearly Constrained Convex Programming ⋮ Asymptotic behavior of the central path for a special class of degenerate SDP problems ⋮ Examples of ill-behaved central paths in convex optimization ⋮ Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming ⋮ Interior hybrid proximal extragradient methods for the linear monotone complementarity problem ⋮ A continuation method for (strongly) monotone variational inequalities ⋮ Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity ⋮ A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem ⋮ Degeneracy in interior point methods for linear programming: A survey ⋮ Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications ⋮ An interior point parameterized central path following algorithm for linearly constrained convex programming

This page was built for publication: Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems