Using deep cuts in an ellipsoid algorithm for nonlinear programming

DOI10.1007/BFB0121078MaRDI QIDQ3707772zbMATH OpenFDO

Authors Stephen T. Dziuban, J. G. Ecker, Michael Kupferschmid

Publication date 1985

Published in Mathematical Programming Essays in Honor of George B. Dantzig Part II (Search for Journal in Brave)

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

zbMATH Keywords

computational experimentsconvex and nonconvex problemsdeep-cut hyperplanesellipsoid algorithm

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A deep cut ellipsoid algorithm for convex programming: Theory and applications
• scientific article; zbMATH DE number 592626
• The ellipsoid algorithm using parallel cuts
• Using two successive subgradients in the ellipsoid method for nonlinear programming
• Active set strategies in an ellipsoid algorithm for nonlinear programming

Cited in

(10)

• A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming
• A deep cut ellipsoid algorithm for convex programming: Theory and applications
• The ellipsoid algorithm using parallel cuts
• Using two successive subgradients in the ellipsoid method for nonlinear programming
• Active set strategies in an ellipsoid algorithm for nonlinear programming
• Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method
• General models in min-max continuous location: Theory and solution techniques
• A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms
• scientific article; zbMATH DE number 1329060 (Why is no real title available?)
• scientific article; zbMATH DE number 592626 (Why is no real title available?)

This page was built for publication: Using deep cuts in an ellipsoid algorithm for nonlinear programming

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