Optimality in convex programming: A feasible directions approach

This publication has 20 references indexed in Scilit:

• Complete characterization of optimality for convex programming in banach spaces †
  Applicable Analysis, 1980
• Characterizations of optimality in convex programming: the nondifferentiable case
  Applicable Analysis, 1979
• Optimality conditions for a cone-convex programming problem
  Journal of the Australian Mathematical Society, 1979
• Duality in convex programming: a linearization approach 1
  Mathematische Operationsforschung und Statistik. Series Optimization, 1979
• On Finding the Maximal Range of Validity of a Constrained System
  SIAM Journal on Control and Optimization, 1978
• Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming
  Econometrica, 1977
• Convex programming and the lexicographic multicriteria problem
  Mathematische Operationsforschung und Statistik. Series Optimization, 1977
• Projections of Convex Programs with Unattained Infima
  SIAM Journal on Control, 1975
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
  SIAM Journal on Control, 1969
• On the continuity of the minimum set of a continuous function
  Journal of Mathematical Analysis and Applications, 1967