Accelerating the Cutting Plane Method for Nonlinear Programming
From MaRDI portal
Cited in
(6)- A cutting-plane algorithm with linear and geometric rates of convergence
- Minimization methods with constraints
- Capacity expansion under a service-level constraint for uncertain demand with lead times
- Computational aspects of cutting-plane algorithms for geometric programming problems
- Zum heutigen Stand der nichtlinearen Optimierungstheorie
- scientific article; zbMATH DE number 3272790 (Why is no real title available?)
This page was built for publication: Accelerating the Cutting Plane Method for Nonlinear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3845825)