An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps
From MaRDI portal
The paper describes an infeasible interior point (IP) method for solving monotone variational inequality problems. The method determines a search direction by solving, possibly in an inexact way, the Newton equation for the central path. Then a curvilinear search is used. In contrast to classical IP methods, this method relaxes the requirement of monotonic decrease in the complementarity gap. Global convergence is proved and numerical experiments are presented.
Recommendations
- An inexact interior point proximal method for the variational inequality problem
- An interior point method for solving monotone linear complementarity problem
- On the dynamical solution of finite-dimensional variational inequalities by an interior point method
- An interior-point-type iterative method for variational inequality problems
- Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems
Cites work
- A class of nonmonotone conjugate gradient methods for unconstrained optimization
- A class on nonmonotone stabilization methods in unconstrained optimization
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- A nonmonotone Broyden method for unconstrained optimization
- A nonmonotone hybrid method for nonlinear systems∗
- A Nonmonotone Line Search Technique for Newton’s Method
- A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization
- A semismooth equation approach to the solution of nonlinear complementarity problems
- A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
- Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
- An inexact interior point method for monotone NCP
- An Infeasible Path-Following Method for Monotone Complementarity Problems
- Global convergence in infeasible-interior-point algorithms
- Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Inexact interior-point method
- Interior-point methods for nonlinear complementarity problems
- Nonmonotone algorithms for pattern search methods
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Nonmonotone stabilization methods for nonlinear equations
- Solving the Nonlinear Complementarity Problem by a Homotopy Method
- The semismooth algorithm for large scale complementarity problems
Cited in
(4)- Inexact non-interior continuation method for solving large-scale monotone SDCP
- Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications
- An inexact interior-point method for system analysis
- Inexact non-interior continuation method for monotone semidefinite complementarity problems
This page was built for publication: An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4709746)