Note on a Fundamental Theorem in Quadratic Programming

DOI10.1137/0112056zbMath0128.39701OpenAlexW2085910884MaRDI QIDQ5336853

Richard W. Cottle

Publication date: 1964

Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0112056

zbMATH Keywords

operations research

Related Items (19)

Global convergence in infeasible-interior-point algorithms ⋮ Bounds for the solution set of linear complementarity problems ⋮ A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps ⋮ Sufficient matrices and the linear complementarity problem ⋮ Monotone solutions of the parametric linear complementarity problem ⋮ Classes of functions and feasibility conditions in nonlinear complementarity problems ⋮ On the complex complementarity problem ⋮ On the parametric linear complementarity problem: A generalized solution procedure ⋮ A computational analysis of LCP methods for bilinear and concave quadratic programming ⋮ On the complex nonlinear complementary problem ⋮ A monotone complementarity problem with feasible solutions but no complementary solutions ⋮ A unified approach to complementarity in optimization ⋮ Pricing American drawdown options under Markov models ⋮ Hidden Z-matrices with positive principal minors ⋮ A matrix structural theory of piecewise linear elastoplasticity with interacting yield planes ⋮ Existence theory for the complex linear complementarity problem ⋮ A theorem of Fritz John in complex programming ⋮ Generalized linear complementarity problems treated without fixed-point theory ⋮ Continuous linear complementarity problem

This page was built for publication: Note on a Fundamental Theorem in Quadratic Programming