Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem

DOI10.1287/MOOR.21.4.793zbMATH Open0867.90111OpenAlexW2026418020MaRDI QIDQ4332252FDOQ4332252

Renato D. C. Monteiro, Takashi Tsuchiya

Publication date: 4 August 1997

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

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

Recommendations

• Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
• scientific article; zbMATH DE number 1306985
• Existence and Limiting Behavior of a Non--Interior-Point Trajectory for Nonlinear Complementarity Problems Without Strict Feasibility Condition
• scientific article; zbMATH DE number 1329458
• On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems

zbMATH Keywords

interior point methodsasymptotic behaviorexistence resultsaffine scaling algorithmmonotone horizontal linear complementarity problemtrajectory of solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cited In (19)

• Analyticity of the central path at the boundary point in semidefinite programming
• Asymptotic behavior of the central path for a special class of degenerate SDP problems
• Title not available (Why is that?)
• Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
• Error bounds for analytic systems and their applications
• Trajectory-following methods for large-scale degenerate convex quadratic programming
• Error bounds in mathematical programming
• A smoothing Gauss-Newton method for the generalized HLCP
• A homotopy method for solving the horizontal linear complementarity problem
• Reducing a monotone horizontal LCP to an LCP
• A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
• Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
• Examples of ill-behaved central paths in convex optimization
• The Convergent Generalized Central Paths for Linearly Constrained Convex Programming
• On the extended linear complementarity problem
• Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
• Analysis of some interior point continuous trajectories for convex programming
• On the complexity of analyticity in semi-definite optimization
• An interior point potential reduction method for constrained equations

This page was built for publication: Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem

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