Global convergence enhancement of classical linesearch interior point methods for MCPs
From MaRDI portal
Publication:1861321
DOI10.1016/S0377-0427(02)00745-8zbMath1016.65043MaRDI QIDQ1861321
Benedetta Morini, Stefania Bellavia
Publication date: 16 March 2003
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
global convergencenumerical examplescomplementarity problemsinterior point methodsbacktracking strategy
Numerical mathematical programming methods (65K05) Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods ⋮ Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications ⋮ Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An interior-point algorithm for nonconvex nonlinear programming
- Handbook of test problems in local and global optimization
- Global convergence in infeasible-interior-point algorithms
- An infeasible-interior-point algorithm for linear complementarity problems
- Inexact interior-point method
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
- On the convergence of Newton iterations to non-stationary points
- Failure of global convergence for a class of interior point methods for nonlinear programming
- Interior-point methods
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Interior-point methods for nonlinear complementarity problems
- On the Newton interior-point method for nonlinear programming problems
- Inexact Newton Methods
- Quasi-Newton Methods, Motivation and Theory
- Solving the Nonlinear Complementarity Problem by a Homotopy Method
- Numerical Optimization
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Globally Convergent Inexact Newton Methods
- A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
- A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity
- An Infeasible Path-Following Method for Monotone Complementarity Problems
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- Engineering and Economic Applications of Complementarity Problems
- An Infeasible-Interior-Point Method for Linear Complementarity Problems
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
This page was built for publication: Global convergence enhancement of classical linesearch interior point methods for MCPs
