Approximate cutting planes in nonlinear programming

DOI10.1007/BF01580386zbMath0351.90062MaRDI QIDQ4121700

Shailendra C. Parikh

Publication date: 1976

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items

Some outer approximation methods for semi-infinite optimization problems, Stochastic Cutting Planes for Data-Driven Optimization, Outer approximation by polyhedral convex sets, On the convergence of a class of outer approximation algorithms for convex programs

Cites Work

• The Cutting-Plane Method for Solving Convex Programs
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item