Weak Sharp Minima in Mathematical Programming
- 1 September 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 31 (5) , 1340-1359
- https://doi.org/10.1137/0331063
Abstract
. The notion of a sharp, or strongly unique, minimum is extended to include the possibility of a nonunique solution set. These minima will be called weak sharp minima. Conditions necessary for the solution set of a minimization problem to be a set of weak sharp minima are developed in both the unconstrained and constrained cases. These conditions are also shown to be sufficient under the appropriate convexity hypotheses. The existence of weak sharp minima is characterized in the cases of linear ...Keywords
This publication has 14 references indexed in Scilit:
- Minimum principle sufficiencyMathematical Programming, 1992
- On the Clarke subdifferential of the distance function of a closed setJournal of Mathematical Analysis and Applications, 1992
- Finite convergence of algorithms for nonlinear programs and variational inequalitiesJournal of Optimization Theory and Applications, 1991
- Characterization of solution sets of convex programsOperations Research Letters, 1991
- Error bounds for nondegenerate monotone linear complementarity problemsMathematical Programming, 1990
- On the Identification of Active ConstraintsSIAM Journal on Numerical Analysis, 1988
- A simple characterization of solution sets of convex programsOperations Research Letters, 1988
- A Gauss-Newton Approach to Solving Generalized InequalitiesMathematics of Operations Research, 1986
- A Review of Numerical Methods for Semi-Infinite OptimizationPublished by Springer Nature ,1983
- Strong uniquenessNumerische Mathematik, 1978