A full-Newton step interior-point method for monotone weighted linear complementarity problems
From MaRDI portal
Publication:2198532
DOI10.1007/S10957-020-01728-4zbMATH Open1441.90163OpenAlexW3047145396MaRDI QIDQ2198532FDOQ2198532
Authors: Soodabeh Asadi, Zsolt Darvay, Nezam Mahdavi-Amiri, Florian A. Potra, Goran Lesaja 
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
Recommendations
- A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
- scientific article; zbMATH DE number 7366754
- A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem
- A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP
- A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- Improved full-Newton-step infeasible interior-point method for linear complementarity problems
- A full-Newton step non-interior continuation algorithm for a class of complementarity problems
- An interior point method for solving monotone linear complementarity problem
Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Corrector-predictor methods for sufficient linear complementarity problems
- A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- A smoothing Newton algorithm for weighted linear complementarity problem
- Weighted complementarity problems -- A new paradigm for computing equilibria
- Interior-point algorithms for a generalization of linear programming and weighted centring
- Sufficient matrices and the linear complementarity problem
- A path to the Arrow-Debreu competitive market equilibrium
- Sufficient weighted complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- New interior point algorithms in linear programming
- A weighted-path-following method for the linear complementarity problem
- A weighted-path-following method for linear optimization
- Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
- An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
- Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP
Cited In (17)
- A nonmonotone smoothing Newton algorithm for weighted complementarity problem
- Title not available (Why is that?)
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
- A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems
- Complexity analysis of a full-Newton step interior-point method for monotone weighted linear complementarity problems
- Kernel-based full-Newton step feasible interior-point algorithm for \(P_* (\kappa)\)-weighted linear complementarity problem
- Title not available (Why is that?)
- A dynamic model to solve weighted linear complementarity problems
- Levenberg-Marquardt method with a general LM parameter and a nonmonotone trust region technique
- A Neural Network Approach for Solving Weighted Nonlinear Complementarity Problems
- A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem
- A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem
- A new full-Newton step feasible interior point method for convex quadratic programming
- A weighted-path-following method for monotone horizontal linear complementarity problem
- A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI
- 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
This page was built for publication: A full-Newton step interior-point method for monotone weighted linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198532)
