Second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems

Second-order necessary and sufficient optimality conditions are given for infinite-dimensional programming problems with constraints defined by closed convex cones. The necessary conditions are an immediate generalization of those known for the finite-dimensional case. However, this does not hold for the sufficient conditions as shown by a counterexample. Modified sufficient conditions are developed for the infinite-dimensional case.