Approximate cutting planes in nonlinear programming

DOI10.1007/BF01580386MaRDI QIDQ4121700zbMATH OpenFDO

Authors Shailendra C. Parikh

Publication date 1976

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01580386

Mathematics Subject Classification ID

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

Cites work

• Convex Analysis
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3238721 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• scientific article; zbMATH DE number 3195517 (Why is no real title available?)
• The Cutting-Plane Method for Solving Convex Programs

Cited in

(4)

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

This page was built for publication: Approximate cutting planes in nonlinear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4121700)