Block pivot methods for solving the complementarity problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3197115 (Why is no real title available?)
- Coercivity Conditions in Nonlinear Complementarity Problems
- Existence theory for generalized nonlinear complementarity problems
- Minimality and complementarity properties associated with Z-functions and M-functions
- Nonlinear Programs with Positively Bounded Jacobians
- On P- and S-functions and related classes of \(n\)-dimensional nonlinear mappings
- On Quadratic Programming
- On a Direct Algorithm for Nonlinear Complementarity Problems
Cited in
(12)- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
- Optimal non-negative forecast reconciliation
- Linear complementarity problems and multiple objective programming
- Block pivoting and shortcut strategies for detecting copositivity
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
- Iterations for solving linear variational inequalities on domains with nonlinear boundaries
- The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- Block pivot methods for solving frictional contact problems
- On a ``stability in the linear complementarity problem
This page was built for publication: Block pivot methods for solving the complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1253090)
