Simple bounds for solutions of monotone complementarity problems and convex programs

DOI10.1007/BF01585657MaRDI QIDQ3683929zbMATH OpenOpenAlexFDO

Authors L. McLinden, O. 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 qualificationdifferentiable convex programmonotone complementarity problem

Mathematics Subject Classification ID

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

Recommendations

• Simple computable bounds for solutions of linear complementarity problems and linear programs
• scientific article; zbMATH DE number 850978
• Error bounds for monotone linear complementarity problems
• Bounds for the solution set of linear complementarity problems
• scientific article; zbMATH DE number 617262

Cites work

• A general correspondence between dual minimax problems and convex programs
• A monotone complementarity problem with feasible solutions but no complementary solutions
• Classes of functions and feasibility conditions in nonlinear complementarity problems
• scientific article; zbMATH DE number 3788387 (Why is no real title available?)
• scientific article; zbMATH DE number 3466042 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• Nonlinear Programs with Positively Bounded Jacobians
• On the basic theorem of complementarity
• Simple computable bounds for solutions of linear complementarity problems and linear programs
• Stable monotone variational inequalities
• Symmetric dual nonlinear programs
• The nonlinear complementarity problem with applications. II

Cited in

(17)

• Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs
• 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
• Augmented Lagrangian algorithms for linear programming
• Domain reduction techniques for global NLP and MINLP optimization
• Asymptotic analysis, existence and sensitivity results for a class of multivalued complementarity problems
• Some new existence, sensitivity and stability results for the nonlinear complementarity problem
• Simple computable bounds for solutions of linear complementarity problems and linear programs
• Stability of convex programs under a distributed constraint qualification
• Estimates for Kuhn-Tucker points of perturbed convex programs
• The numerical range theory and boundedness of solutions of the complementarity problem
• The numerical range theory and boundedness of solutions of the complementarity problem
• A little theorem of the big \({\mathcal M}\) in interior point algorithms
• Stable monotone variational inequalities
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• Error bounds for the linear complementarity problem with a P-matrix

This page was built for publication: Simple bounds for solutions of monotone complementarity problems and convex programs

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