Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
type: Item
instance of: scholarly article
title: Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
zbMATH Open document ID: 1054.90635
DOI: 10.1023/A:1022606324827
author: Yanyan Li
published in: Journal of Optimization Theory and Applications
publication date: 1999-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 1367780
zbMATH Keywords: polynomial complexity
zbMATH Keywords: scaled Lipschitz condition
zbMATH Keywords: interior-point algorithm
zbMATH Keywords: nonlinear \(P_*\)-complementarity
MaRDI profile type: Publication
cites work: Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems
cites work: Q4003375
cites work: Complementarity problems
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
cites work: A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
cites work: Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: An interior point potential reduction algorithm for the linear complementarity problem
cites work: A new continuation method for complementarity problems with uniform P- functions
cites work: A polynomial-time algorithm for a class of linear complementarity problems
cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
cites work: Interior-point methods for nonlinear complementarity problems
cites work: A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
cites work: An Infeasible Path-Following Method for Monotone Complementarity Problems
cites work: Q4323620
cites work: A class of linear complementarity problems solvable in polynomial time
cites work: On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
cites work: Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
cites work: A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
cites work: Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
cites work: A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
cites work: Global linear convergence of a path-following algorithm for some monotone variational inequality problems
cites work: A path following algorithm for a class of convex programming problems
cites work: Modified primal path-following scheme for the monotone variational inequality problem
cites work: \(P_ *\)-matrices are just sufficient
cites work: Determining the handicap of a sufficient matrix
cites work: Exceptional family of elements for a variational inequality problem and its applications
full work available at URL: a:1022606324827
OpenAlex ID: W1553507387
description: scientific article; zbMATH DE number 1367780