A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem

DOI10.1002/nav.3800320306zbMath0583.90057OpenAlexW2028115995MaRDI QIDQ3706829

Daniel Solow, Partha Pratim Sengupta

Publication date: 1985

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800320306

zbMATH Keywords

linear complementaritydescent algorithmComputational resultspiece-wise linear convex minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (6)

A constrained optimization approach to solving certain systems of convex equations ⋮ Linear complementarity problems and multiple objective programming ⋮ A finite improvement algorithm for the linear complementarity problem ⋮ The effectiveness of finite improvement algorithms for finding global optima ⋮ A class of convergent generalized hill climbing algorithms ⋮ Linear, quadratic, and bilinear programming approaches to the linear complementarity problem

Cites Work

• Unnamed Item

This page was built for publication: A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem