Generalization of Murty's direct algorithm to linear and convex quadratic programming

DOI10.1007/BF00939630zbMath0651.90087MaRDI QIDQ1106739

Michael M. Kostreva

Publication date: 1989

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

optimality conditionserror controlconvex quadratic programmingequality and inequality constraintsMurty's algorithm

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (9)

New perturbation results for solving the linear complementarity problem with \(P_o\)-matrices ⋮ Norm-relaxed method of feasible directions for solving nonlinear programming problems ⋮ Convergence analysis of norm-relaxed method of feasible directions ⋮ Self-tuning norm-relaxed method of feasible directions ⋮ Relative difference in diversity between populations ⋮ The vertical linear complementarity problem associated withP_o-matrices ⋮ Future paths for integer programming and links to artificial intelligence ⋮ Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD ⋮ A generalization of the norm-relaxed method of feasible directions

Uses Software

• LINPACK
• Algorithm 431
• IMSL Numerical Libraries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elasto-hydrodynamic lubrication: A non-linear complementarity problem
• Sets of Generalized Complementarity Problems and P-Matrices
• Classes of functions and feasibility conditions in nonlinear complementarity problems
• Robust implementation of Lemke's method for the linear complementarity problem
• On a Direct Algorithm for Nonlinear Complementarity Problems

This page was built for publication: Generalization of Murty's direct algorithm to linear and convex quadratic programming