Simple bounds for solutions of monotone complementarity problems and convex programs
- 1 May 1985
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 32 (1) , 32-40
- https://doi.org/10.1007/bf01585657
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Simple Computable Bounds for Solutions of Linear Complementarity Problems and Linear Programs.Published by Defense Technical Information Center (DTIC) ,1983
- A monotone complementarity problem with feasible solutions but no complementary solutionsMathematical Programming, 1977
- Classes of functions and feasibility conditions in nonlinear complementarity problemsMathematical Programming, 1974
- Coercivity Conditions in Nonlinear Complementarity ProblemsSIAM Review, 1974
- On the basic theorem of complementarityMathematical Programming, 1971
- The nonlinear complementarity problem with applications, part 2Journal of Optimization Theory and Applications, 1969
- A general correspondence between dual minimax problems and convex programsPacific Journal of Mathematics, 1968
- Nonlinear Programs with Positively Bounded JacobiansSIAM Journal on Applied Mathematics, 1966
- Symmetric dual nonlinear programsPacific Journal of Mathematics, 1965
- ber Abbildung von MannigfaltigkeitenMathematische Annalen, 1911