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

DOI10.1287/MOOR.15.4.662zbMATH Open0719.90085OpenAlexW2059352176MaRDI QIDQ5752302FDOQ5752302

Authors: Masakazu Kojima, Shinji Mizuno, 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

Recommendations

• Homotopy Continuation Methods for Nonlinear Complementarity Problems
• scientific article; zbMATH DE number 1329458
• A General Framework of Continuation Methods for Complementarity Problems
• Existence and Limiting Behavior of a Non--Interior-Point Trajectory for Nonlinear Complementarity Problems Without Strict Feasibility Condition
• A new continuation method for complementarity problems with uniform P- functions

zbMATH Keywords

complementarity problemlimiting behavior

Mathematics Subject Classification ID

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

Cited In (29)

• Interior-point methods for nonlinear complementarity problems
• Asymptotic behavior of the central path for a special class of degenerate SDP problems
• Title not available (Why is that?)
• Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
• The convergent generalized central paths for linearly constrained convex programming
• Existence and Limiting Behavior of a Non--Interior-Point Trajectory for Nonlinear Complementarity Problems Without Strict Feasibility Condition
• A continuation method for (strongly) monotone variational inequalities
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• A new path-following algorithm for nonlinear \(P_*\) complementarity problems
• Degeneracy in interior point methods for linear programming: A survey
• Trajectory-following methods for large-scale degenerate convex quadratic programming
• The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function
• Title not available (Why is that?)
• Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
• An interior point parameterized central path following algorithm for linearly constrained convex programming
• A globally convergent primal-dual interior point algorithm for convex programming
• Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
• Some properties of generalized proximal point methods for quadratic and linear programming
• Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
• Examples of ill-behaved central paths in convex optimization
• A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem
• A continuation method for monotone variational inequalities
• Analysis of some interior point continuous trajectories for convex programming
• Interior hybrid proximal extragradient methods for the linear monotone complementarity problem
• Novel approaches to the discrimination problem
• THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
• 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
• The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra

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

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