Optimality conditions for nondifferentiable convex semi-infinite programming |
| |
Authors: | M A López E Vercher |
| |
Institution: | (1) Department of Statistics and Operations Research, Faculty of Mathematics, University of Valencia, Spain |
| |
Abstract: | This paper gives characterizations of optimal solutions to the nondifferentiable convex semi-infinite programming problem,
which involve the notion of Lagrangian saddlepoint. With the aim of giving the necessary conditions for optimality, local
and global constraint qualifications are established. These constraint qualifications are based on the property of Farkas-Minkowski,
which plays an important role in relation to certain systems obtained by linearizing the feasible set. It is proved that Slater's
qualification implies those qualifications. |
| |
Keywords: | Semi-Infinite Programming Convex Functions Lagrangian Saddlepoints Constraint Quanlifications Optimality Conditions Farkas-Minkowski Systems |
本文献已被 SpringerLink 等数据库收录! |