Sufficient weighted complementarity problems
From MaRDI portal
Publication:288407
DOI10.1007/s10589-015-9811-zzbMath1369.90176OpenAlexW2283324111MaRDI QIDQ288407
Publication date: 25 May 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9811-z
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, Weighted LCPs and interior point systems for copositive linear transformations on Euclidean Jordan algebras, A dynamic model to solve weighted linear complementarity problems, A full-Newton step interior-point method for monotone 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, The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra, 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, A new smoothing-type algorithm for nonlinear weighted complementarity problem, A smoothing Newton method with a mixed line search for monotone weighted complementarity problems, A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem
Cites Work
- Unnamed Item
- Unnamed Item
- Corrector-predictor methods for sufficient linear complementarity problems
- On the complexity of computing the handicap of a sufficient matrix
- A scaling technique for finding the weighted analytic center of a polytope
- A polynomial path-following interior point algorithm for general linear complementarity problems
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
- Sufficient matrices and the linear complementarity problem
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
- Reducing a monotone horizontal LCP to an LCP
- On a subclass of \(P_ 0\)
- \(P_ *\)-matrices are just sufficient
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
- Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
- A path to the Arrow-Debreu competitive market equilibrium
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
- High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
- Consensus of Subjective Probabilities: The Pari-Mutuel Method
- Equivaence between different formulations of the linear complementarity promblem
- Generalized Linear Complementarity Problems
- Weighted Complementarity Problems---A New Paradigm for Computing Equilibria
- 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
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Convex Analysis
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- High order long-step methods for solving linear complementarity problems
