Sufficient weighted complementarity problems
From MaRDI portal
Publication:288407
Recommendations
- Weighted complementarity problems -- A new paradigm for computing equilibria
- A smoothing Newton algorithm for weighted linear complementarity problem
- Equilibria and weighted complementarity problems
- A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem
- A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- A path to the Arrow-Debreu competitive market equilibrium
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A scaling technique for finding the weighted analytic center of a polytope
- A strongly polynomial rounding procedure yielding a maximally complementary solution for \(P_*(\kappa)\) linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
- Consensus of Subjective Probabilities: The Pari-Mutuel Method
- Convex Analysis
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- Corrector-predictor methods for sufficient linear complementarity problems
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- Equivaence between different formulations of the linear complementarity promblem
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
- Generalized Linear Complementarity Problems
- High order infeasible-interior-point methods for solving sufficient linear complementarity problems
- High order long-step methods for solving linear complementarity problems
- Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
- Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
- Interior-point algorithms for a generalization of linear programming and weighted centring
- On a subclass of \(P_ 0\)
- On the complexity of computing the handicap of a sufficient matrix
- Polynomial interior point algorithms for general linear complementarity problems
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
- Reducing a monotone horizontal LCP to an LCP
- Sufficient matrices and the linear complementarity problem
- Weighted complementarity problems -- A new paradigm for computing equilibria
- \(P_ *\)-matrices are just sufficient
Cited in
(22)- A full-Newton step feasible interior-point algorithm for solving the general Fisher market equilibrium
- Equilibria and weighted complementarity problems
- A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
- A new smoothing-type algorithm for nonlinear weighted complementarity problem
- A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem
- Levenberg-Marquardt method with a general LM parameter and a nonmonotone trust region technique
- A dynamic model to solve weighted linear complementarity problems
- A full-Newton step interior-point method for monotone weighted linear complementarity problems
- Weighted complementarity problems -- A new paradigm for computing equilibria
- The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra
- 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
- The image of weighted combinatorial 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
- A nonmonotone smoothing Newton algorithm for weighted complementarity problem
- A modified damped Gauss-Newton method for non-monotone weighted linear complementarity problems
- Weighted LCPs and interior point systems for copositive linear transformations on Euclidean Jordan algebras
- A Neural Network Approach for Solving Weighted Nonlinear Complementarity Problems
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
- A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem
This page was built for publication: Sufficient weighted complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288407)
