Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
type: Item
instance of: scholarly article
title: Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
zbMATH Open document ID: 0889.90138
DOI: 10.1007/BF02614359
author: Benjamin Jansen
author: Kees Roos
author: Tamás Terlaky
author: Akiko Yoshise
published in: Mathematical Programming. Series A. Series B
publication date: 1997-09-10T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1059874
zbMATH Keywords: polynomiality
zbMATH Keywords: primal-dual interior point algorithms
zbMATH Keywords: nonlinear complementarity
zbMATH Keywords: affine scaling
MaRDI profile type: Publication
cites work: A New Infinity-Norm Path Following Algorithm for Linear Programming
cites work: Q4003375
cites work: Q5583564
cites work: Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables
cites work: Path-Following Methods for Linear Programming
cites work: Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
cites work: Generalized Linear Complementarity Problems
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: Q4296156
cites work: A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
cites work: On the classical logarithmic barrier function method for a class of smooth convex programming problems
cites work: A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
cites work: A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
cites work: Q3995706
cites work: Interior-point methods for convex programming
cites work: Large-Step Interior Point Algorithms for Linear Complementarity Problems
cites work: Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
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: Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
cites work: A polynomial-time algorithm for a class of linear complementarity problems
cites work: Q3491304
cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
cites work: Global convergence in infeasible-interior-point algorithms
cites work: On some efficient interior point methods for nonlinear convex programming
cites work: A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
cites work: O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming
cites work: An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
cites work: A Positive Algorithm for the Nonlinear Complementarity Problem
cites work: Q4324980
cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: NE/SQP: A robust algorithm for the nonlinear complementarity problem
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: 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: On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
cites work: A class of linear complementarity problems solvable in polynomial time
cites work: A path following algorithm for a class of convex programming problems
full work available at URL: https://doi.org/10.1007/bf02614359
OpenAlex ID: W1982718164
description: scientific article; zbMATH DE number 1059874