A dynamic model to solve weighted linear complementarity problems
DOI10.3934/JIMO.2023015zbMATH Open1524.90318OpenAlexW4321380116MaRDI QIDQ6175367FDOQ6175367
Authors: Dongmei Yu, Cai-Rong Chen, Deren Han 
Publication date: 21 July 2023
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2023015
simulationasymptotic stabilitydynamic modelequilibrium pointmonotone weighted linear complementarity problem
Numerical optimization and variational techniques (65K10) Linear programming (90C05) Nonlinear programming (90C30) Dynamical systems in optimization and economics (37N40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Nonlinear systems
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- A smoothing Newton algorithm for weighted linear complementarity problem
- Weighted Complementarity Problems---A New Paradigm for Computing Equilibria
- Sufficient weighted complementarity problems
- Nash equilibria, variational inequalities, and dynamical systems
- A neural network for the linear complementarity problem
- A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
- A dynamic model to solve the absolute value equations
- An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function
- The forward-backward-forward method from continuous and discrete perspective for pseudo-monotone variational inequalities in Hilbert spaces
- On the global exponential stability of a projected dynamical system for strongly pseudomonotone variational inequalities
- Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
- A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
- An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs
- A nonmonotone smoothing Newton algorithm for weighted complementarity problem
- An inverse-free dynamical system for solving the absolute value equations
- A dynamical system for strongly pseudo-monotone equilibrium problems
- A full-Newton step interior-point method for monotone weighted linear complementarity problems
- The global exponential stability of a dynamical system for solving variational inequalities
- A new smoothing-type algorithm for nonlinear weighted complementarity problem
- A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems
This page was built for publication: A dynamic model to solve weighted linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175367)
