Sufficient weighted complementarity problems

DOI10.1007/S10589-015-9811-ZzbMATH Open1369.90176OpenAlexW2283324111MaRDI QIDQ288407FDOQ288407

Authors: Florian A. Potra 

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

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

zbMATH Keywords

equilibrium problemsinterior-pointpath-followingsufficient matrixweighted complementarity

Mathematics Subject Classification ID

Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Convex Analysis
• Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• \(P_ *\)-matrices are just sufficient
• A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
• Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
• Title not available (Why is that?)
• Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
• Corrector-predictor methods for sufficient linear complementarity problems
• High order infeasible-interior-point methods for solving sufficient linear complementarity problems
• Consensus of Subjective Probabilities: The Pari-Mutuel Method
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• 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
• 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\)
• Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
• 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 strongly polynomial rounding procedure yielding a maximally complementary solution for \(P_*(\kappa)\) linear complementarity problems
• Polynomial interior point algorithms for general linear complementarity problems
• Equivaence between different formulations of the linear complementarity promblem
• Generalized Linear Complementarity Problems
• Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
• 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
• 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

Cited In (21)

• A nonmonotone smoothing Newton algorithm for weighted complementarity problem
• Weighted LCPs and interior point systems for copositive linear transformations on Euclidean Jordan algebras
• Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
• Equilibria and weighted complementarity problems
• 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
• Weighted complementarity problems -- A new paradigm for computing equilibria
• A full-Newton step interior-point method for monotone weighted linear complementarity problems
• 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 smoothing-type algorithm for nonlinear weighted complementarity problem
• The image of weighted combinatorial problems
• A smoothing Newton method with a mixed line search for monotone weighted 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
• The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra

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)