Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones
DOI10.1080/02331934.2010.524216zbMath1232.65083OpenAlexW2023933408MaRDI QIDQ3112509
Wesley V. I. Shirabayashi, Sandra Augusta Santos, Roberto Andreani
Publication date: 10 January 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2010.524216
Newton's methodinterior-point methodpredictor-corrector methodpolyhedral conesgeneralized nonlinear complementarity problem
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Cites Work
- A nonsmooth L-M method for solving the generalized nonlinear complementarity problem over a polyhedral cone
- Global convergence in infeasible-interior-point algorithms
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- A Newton method for a class of quasi-variational inequalities
- Numerical comparisons of path-following strategies for a primal-dual interior-point method for nonlinear programming
- A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Interior-point methods for nonlinear complementarity problems
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- A smoothing Newton-type method for generalized nonlinear complementarity problem
- A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone
- On the Resolution of the Generalized Nonlinear Complementarity Problem
- Unconstrained optimization reformulation of the generalized nonlinear complementarity problem and related method
- Mehrotra-type predictor-corrector algorithm revisited
- On large-scale unconstrained optimization problems and higher order methods
- On the Implementation of a Primal-Dual Interior Point Method
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
- A family of Chebyshev-Halley type methods in Banach spaces
- An Infeasible-Interior-Point Method for Linear Complementarity Problems
- A Trust Region Method for Solving Generalized Complementarity Problems
- The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method
- Interior Point Methods for Linear Optimization
This page was built for publication: Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones
