Computational complexity of LCPs associated with positive definite symmetric matrices
From MaRDI portal
Publication:3854941
DOI10.1007/BF01588254zbMath0421.90072OpenAlexW1997984350MaRDI QIDQ3854941
Publication date: 1979
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01588254
Analysis of algorithms and problem complexity (68Q25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A non-monotone inexact regularized smoothing Newton method for solving nonlinear complementarity problems, NP-completeness of the linear complementarity problem, A modified feasible semi-smooth asymptotically Newton method for nonlinear complementarity problems, Generalized Newton method in contact mechanics, Affirmative action algorithms, A new path-following algorithm for nonlinear \(P_*\) complementarity problems, Some LCPs solvable in strongly polynomial time with Lemke's algorithm, On the number of iterations of local improvement algorithms, A polynomial-time algorithm for a class of linear complementarity problems, A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem, A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics, An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function, Finite termination of a Newton-type algorithm for a class of affine variational inequality problems, A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems, On solving linear complementarity problems by DC programming and DCA, A new proof for the criss-cross method for quadratic programming, The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function, A new smoothing Broyden-like method for solving nonlinear complementarity problem with a \(P_{0}\)-function, Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem, Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem, On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities, A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones, A mixed formulation for frictional contact problems prone to Newton like solution methods, A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems, Unnamed Item, Verification for existence of solutions of linear complementarity problems, A continuation method for linear complementarity problems withP0matrix, A new smoothing and regularization Newton method for \(P_{0}\)-NCP, The steepest descent gravitational method for linear programming, An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function, Low order polynomial bounds on the expected performance of local improvement algorithms, Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's, On the computational complexity of piecewise-linear homotopy algorithms, A partially smoothing Jacobian method for nonlinear complementarity problems with \(P_0\) function, Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones, An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complementary pivot theory of mathematical programming
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- Computational complexity of complementary pivot methods
- Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem
- Bimatrix Equilibrium Points and Mathematical Programming
- On a Characterization ofP-Matrices
- On the Alass of Complementary Cones and Lemke’s Algorithm
- Monotone solutions of the parametric linear complementarity problem
