Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
From MaRDI portal
Publication:5929885
DOI10.1007/s002450010021zbMath1033.90132OpenAlexW1998299736MaRDI QIDQ5929885
No author found.
Publication date: 18 February 2004
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002450010021
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (10)
Fast convergence of an inexact interior point method for horizontal complementarity problems ⋮ Feasibility problems with complementarity constraints ⋮ DC programming and DCA for solving Brugnano-Casulli piecewise linear systems ⋮ Algorithms for linear programming with linear complementarity constraints ⋮ On solving linear complementarity problems by DC programming and DCA ⋮ A practical optimality condition without constraint qualifications for nonlinear programming ⋮ A projected-gradient interior-point algorithm for complementarity problems ⋮ On the natural merit function for solving complementarity problems ⋮ On the solution of NP-hard linear complementarity problems ⋮ Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
Uses Software
This page was built for publication: Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
