A quadratically convergent scaling newton’s method for nonlinear complementarity problems
From MaRDI portal
Publication:4836762
DOI10.1080/02331939508844071zbMath0820.65034OpenAlexW2067484769MaRDI QIDQ4836762
Publication date: 21 June 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939508844071
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
- A new polynomial-time algorithm for linear programming
- A new continuation method for complementarity problems with uniform P- functions
- A polynomial-time algorithm for a class of linear complementarity problems
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Equality and inequality constrained optimization algorithms with convergent stepsizes
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- The Projective SUMT Method for Convex Programming
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
- A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming
- On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
This page was built for publication: A quadratically convergent scaling newton’s method for nonlinear complementarity problems
