Note on a Fundamental Theorem in Quadratic Programming

DOI10.1137/0112056MaRDI QIDQ5336853zbMATH OpenOpenAlexFDO

Authors R. 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

Cited in

(20)

• Generalized linear complementarity problems treated without fixed-point theory
• Bounds for the solution set of linear complementarity problems
• Sufficient matrices and the linear complementarity problem
• On the parametric linear complementarity problem: A generalized solution procedure
• A computational analysis of LCP methods for bilinear and concave quadratic programming
• A unified approach to complementarity in optimization
• Hidden Z-matrices with positive principal minors
• Continuous linear complementarity problem
• Global convergence in infeasible-interior-point algorithms
• Pricing American drawdown options under Markov models
• 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
• A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps
• Classes of functions and feasibility conditions in nonlinear complementarity problems
• On the complex complementarity problem
• On the complex nonlinear complementary problem
• A monotone complementarity problem with feasible solutions but no complementary solutions
• Monotone solutions of the parametric linear complementarity problem
• Quasi-static loading of granular media as a linear complementarity problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5336853)