Fast convergence of an inexact interior point method for horizontal complementarity problems
From MaRDI portal
Publication:1625766
DOI10.1007/s11075-018-0480-8OpenAlexW2792680258MaRDI QIDQ1625766
C. A. Arias, José Mario Martínez
Publication date: 29 November 2018
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-018-0480-8
global convergenceinterior point methodslocal convergenceinexact Newton methodprojected gradientshorizontal complementarity problems
Related Items
Un algoritmo Newton inexacto para complementariedad horizontal, Modulus-based matrix splitting methods for a class of horizontal nonlinear complementarity problems, Global inexact quasi-Newton method for nonlinear system of equations with constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Feasibility problems with complementarity constraints
- Matrix-free interior point method
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- A projected-gradient interior-point algorithm for complementarity problems
- On the natural merit function for solving complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Inexact interior-point method
- Feasible descent algorithms for mixed complementarity problems
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs
- Elasto-hydrodynamic lubrication: A non-linear complementarity problem
- Engineering and Economic Applications of Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
