On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms

This publication has 10 references indexed in Scilit:

• Combined phase I—phase II methods of feasible directions
  Mathematical Programming, 1979
• An algorithm for optimization problems with functional inequality constraints
  IEEE Transactions on Automatic Control, 1976
• Applications of a general convergence theory for outer approximation algorithms
  Mathematical Programming, 1973
• Rate of Convergence of a Class of Methods of Feasible Directions
  SIAM Journal on Numerical Analysis, 1973
• Generalized Cutting Plane Algorithms
  SIAM Journal on Control, 1971
• Convex Analysis
  Published by Walter de Gruyter GmbH ,1970
• Cutting-Plane Methods without Nested Constraint Sets
  Operations Research, 1970
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
  SIAM Journal on Control, 1967
• The Cutting-Plane Method for Solving Convex Programs
  Journal of the Society for Industrial and Applied Mathematics, 1960
• Newton's method for convex programming and Tchebycheff approximation
  Numerische Mathematik, 1959