Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 10:51, 30 July 2024

scientific article

Language	Label	Description	Also known as
English	Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems	scientific article

Statements

scholarly article

0 references

Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (English)

0 references

Benjamin Jansen

0 references

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

10 September 1997

0 references

zbMATH Keywords

polynomiality

0 references

primal-dual interior point algorithms

0 references

nonlinear complementarity

0 references

affine scaling

0 references

MaRDI profile type

MaRDI publication profile

0 references

A New Infinity-Norm Path Following Algorithm for Linear Programming

0 references

0 references

0 references

Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables

0 references

Path-Following Methods for Linear Programming

0 references

Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems

0 references

Generalized Linear Complementarity Problems

0 references

Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications

0 references

0 references

A sufficient condition for self-concordance, with application to some classes of structured convex programming problems

0 references

On the classical logarithmic barrier function method for a class of smooth convex programming problems

0 references

A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems

0 references

A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming

0 references

0 references

Interior-point methods for convex programming

0 references

Large-Step Interior Point Algorithms for Linear Complementarity Problems

0 references

Theoretical convergence of large-step primal-dual interior point algorithms for linear programming

0 references

A unified approach to interior point algorithms for linear complementarity problems: A summary

0 references

An interior point potential reduction algorithm for the linear complementarity problem

0 references

A new continuation method for complementarity problems with uniform P- functions

0 references

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

0 references

A polynomial-time algorithm for a class of linear complementarity problems

0 references

0 references

An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems

0 references

Global convergence in infeasible-interior-point algorithms

0 references

On some efficient interior point methods for nonlinear convex programming

0 references

A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems

0 references

O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming

0 references

An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem

0 references

Interior path following primal-dual algorithms. I: Linear programming

0 references

Interior path following primal-dual algorithms. II: Convex quadratic programming

0 references

An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence

0 references

A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension

0 references

A Positive Algorithm for the Nonlinear Complementarity Problem

0 references

0 references

Self-Scaled Barriers and Interior-Point Methods for Convex Programming

0 references

NE/SQP: A robust algorithm for the nonlinear complementarity problem

0 references

Interior-point methods for nonlinear complementarity problems

0 references

A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems

0 references

A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup>

0 references

Global linear convergence of a path-following algorithm for some monotone variational inequality problems

0 references

On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP

0 references

A class of linear complementarity problems solvable in polynomial time

0 references

A path following algorithm for a class of convex programming problems

0 references

full work available at URL

https://doi.org/10.1007/bf02614359

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/BF02614359

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1366422

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1366422&oldid=37355439"