Simple bounds for solutions of monotone complementarity problems and convex programs

DOI10.1007/BF01585657zbMath0567.90093OpenAlexW2093368338MaRDI QIDQ3683929

L. McLinden, Olvi L. Mangasarian

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585657

zbMATH Keywords

boundsconstraint qualificationmonotone complementarity problemdifferentiable convex program

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

A class of nonlinear complementarity problems for multifunctions, A dual exact penalty formulation for the linear complementarity problem, Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs, Domain reduction techniques for global NLP and MINLP optimization, Stability of convex programs under a distributed constraint qualification, Some new existence, sensitivity and stability results for the nonlinear complementarity problem, Error bounds for the linear complementarity problem with a P-matrix, The numerical range theory and boundedness of solutions of the complementarity problem, The numerical range theory and boundedness of solutions of the complementarity problem, Estimates for Kuhn-Tucker points of perturbed convex programs, A little theorem of the big \({\mathcal M}\) in interior point algorithms, Asymptotic analysis, existence and sensitivity results for a class of multivalued complementarity problems, Stable monotone variational inequalities, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, Augmented Lagrangian algorithms for linear programming

Cites Work

• Stable monotone variational inequalities
• Symmetric dual nonlinear programs
• A general correspondence between dual minimax problems and convex programs
• The nonlinear complementarity problem with applications. II
• Simple computable bounds for solutions of linear complementarity problems and linear programs
• Classes of functions and feasibility conditions in nonlinear complementarity problems
• A monotone complementarity problem with feasible solutions but no complementary solutions
• Nonlinear Programs with Positively Bounded Jacobians
• On the basic theorem of complementarity
• Unnamed Item
• Unnamed Item
• Unnamed Item