Minimum principle sufficiency

DOI10.1007/BF01581071zbMath0760.90076MaRDI QIDQ1198327

Michael C. Ferris, Olvi L. Mangasarian

Publication date: 16 January 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

minimum principlemonotone linear complementarity

Mathematics Subject Classification ID

Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Minimum and maximum principle sufficiency properties for nonsmooth variational inequalities, On a class of controlled differential variational inequalities, Weak sharp solutions associated with a multidimensional variational-type inequality, A Lipschitzian error bound for convex quadratic symmetric cone programming, Error estimates and Lipschitz constants for best approximation in continuous function spaces, Error bounds in mathematical programming, Continuities of metric projection and geometric consequences, Weak sharp solutions for variational inequalities in Banach spaces, Characterization of weakly sharp solutions of a variational-type inequality with convex functional, Some results on (ρ, b, d)-variational inequalities, Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs, Pseudomonotone\(_*\) maps and the cutting plane property, Minimum and maximum principle sufficiency for a nonsmooth variational inequality, A maximum principle approach to risk indifference pricing with partial information, On Controlled Variational Inequalities Involving Convex Functionals, On weak sharp solutions in \((\rho , \mathbf{b}, \mathbf{d})\)-variational inequalities, Some aspects of nonsmooth variational inequalities on Hadamard manifolds, Error bounds and strong upper semicontinuity for monotone affine variational inequalities, On a class of variational-type inequalities involving curvilinear integral functionals, Finite convergence of algorithms for nonlinear programs and variational inequalities, First-order conditions for isolated locally optimal solutions

Cites Work

• Unnamed Item
• Unnamed Item
• Error bounds for nondegenerate monotone linear complementarity problems
• Finite convergence of algorithms for nonlinear programs and variational inequalities
• A simple characterization of solutions sets of convex programs
• Optimal simplex tableau characterization of unique and bounded solutions of linear programs
• A stable theorem of the alternative: An extension of the Gordan theorem
• Finite termination of the proximal point algorithm
• On the convergence of projected gradient processes to singular critical points
• Characterization of solution sets of convex programs
• Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
• Projected gradient methods for linearly constrained problems
• Nonlinear Perturbation of Linear Programs
• Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
• Necessary and sufficient conditions for a penalty method to be exact