A full-Newton step interior-point method for monotone weighted linear complementarity problems
From MaRDI portal
Publication:2198532
DOI10.1007/s10957-020-01728-4zbMath1441.90163OpenAlexW3047145396MaRDI QIDQ2198532
Florian A. Potra, Zsolt Darvay, Soodabeh Asadi, Nezam Mahdavi-Amiri, Goran Lešaja
Publication date: 10 September 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01728-4
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems ⋮ A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI ⋮ A dynamic model to solve weighted linear complementarity problems ⋮ An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems ⋮ The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function ⋮ Unnamed Item ⋮ Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem ⋮ A nonmonotone smoothing Newton algorithm for weighted complementarity problem ⋮ A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem
Cites Work
- A smoothing Newton algorithm for weighted linear complementarity problem
- Sufficient weighted complementarity problems
- Corrector-predictor methods for sufficient linear complementarity problems
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Sufficient matrices and the linear complementarity problem
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- A path to the Arrow-Debreu competitive market equilibrium
- An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
- Weighted Complementarity Problems---A New Paradigm for Computing Equilibria
- Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP
- Interior-point algorithms for a generalization of linear programming and weighted centring
- Unnamed Item
- Unnamed Item
- Unnamed Item
