An Infeasible Path-Following Method for Monotone Complementarity Problems

DOI10.1137/S105262349427409XzbMATH Open0882.90123MaRDI QIDQ4340804FDOQ4340804

Authors: Paul Tseng 

Publication date: 12 June 1997

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Recommendations

• Path-following algorithms for monotone weighted complementarity problems
• Nonmonotone path following methods for nonsmooth equations and complementarity problems
• Path-following interior-point algorithm for monotone linear complementarity problems
• A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
• On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems
• A wide-neighborhood path-following algorithms for a class of nonmonotonic linear complementary problems and its computational complexity
• A new path-following algorithm for nonlinear \(P_*\) complementarity problems
• scientific article; zbMATH DE number 1054759
• Modifications of a wide-neighborhood path-following algorithm for a class of nonmonotonic linear complementary problems
• A weighted-path-following method for monotone horizontal linear complementarity problem

zbMATH Keywords

local quadratic convergencemonotone complementarity problemmonotone complementarityglobal Q-linear convergenceinfeasible path-following method

Mathematics Subject Classification ID

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

Cited In (20)

• Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
• Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
• Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
• A non-interior implicit smoothing approach to complementarity problems for frictionless contacts
• Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications
• A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics
• A new path-following algorithm for nonlinear \(P_*\) complementarity problems
• Error bounds for \(R_0\)-type and monotone nonlinear complementarity problems.
• Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems
• Solution of monotone complementarity problems with locally Lipschitzian functions
• An infeasible-start path-following method for monotone LCPs
• The asymptotic Browder Hartman Stampacchia condition and interior bands of \(\varepsilon\)-solutions for nonlinear complementarity problems
• The complexity of self-regular proximity based infeasible IPMs
• A regularized projection method for complementarity problems with non-Lipschitzian functions
• Existence, Characterization, and Approximation in the Generalized Monotone-Follower Problem
• A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^*
• Global convergence enhancement of classical linesearch interior point methods for MCPs
• An inexact interior point method for monotone NCP
• An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps
• Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp^∗

This page was built for publication: An Infeasible Path-Following Method for Monotone Complementarity Problems

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