scientific article
From MaRDI portal
Publication:3320129
zbMath0535.90068MaRDI QIDQ3320129
Sung-Jin Chung, Katta G. Murty
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Integer programming (90C10) Quadratic programming (90C20) Methods of successive quadratic programming type (90C55)
Related Items
Strongly polynomial algorithm for a class of combinatorial LCPs ⋮ A Variable-Complexity Norm Maximization Problem ⋮ Absolute value programming ⋮ A canonical dual approach for solving linearly constrained quadratic programs ⋮ On solving \(L_{q}\)-penalized regressions ⋮ Two counterexamples on the polynomial solvability of the linear complementarity problem ⋮ Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms ⋮ Improved algorithms for linear complementarity problem arising from collision response ⋮ The steepest descent gravitational method for linear programming ⋮ The linear complementarity problem as a separable bilinear program ⋮ A new penalty function algorithm for convex quadratic programming
