Norma G. Rueda

Learn More
A second-order dual to a nonlinear programming problem is formulated. This dual uses the Ritz John necessary optimality conditions instead of the Karush-Kuhn-Tucker necessary optimal&y conditions, and thus, does not require a constraint qualification. Weak, strong, strict-converse, and converse duality theorems between primal and dual problems are(More)
  • 1