scientific article; zbMATH DE number 3948004
From MaRDI portal
Publication:3718489
[For the entire collection see Zbl 0572.00008.] The authors describe a modification of the cutting-plane method of Kelley by introducing a parameter which can be modified at each iteration. For a quadratic convex function the parameter can be chosen equal to zero. According to the authors, computational experiments have shown that the method is very efficient.
Recommendations
Cited in
(6)- Modified cutting plane method for minimization of a convex function
- The Newton direction and the cutting plane
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
- An optimal variant of Kelley's cutting-plane method
- scientific article; zbMATH DE number 3904352 (Why is no real title available?)
- An efficient descent direction method with cutting planes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718489)