scientific article; zbMATH DE number 592626

MaRDI QIDQ4296824zbMATH OpenFDO

Authors J. G. B. Frenk, Joaquim A. S. Gromicho, Frank Plastria, Shuzhong Zhang

Publication date 21 June 1994

zbMATH Keywords

deep cut versionellipsoid algorithmquasiconvex functions

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Nonconvex programming, global optimization (90C26)

Recommendations

• A deep cut ellipsoid algorithm for convex programming: Theory and applications
• Using deep cuts in an ellipsoid algorithm for nonlinear programming
• Quasiconvex optimization and location theory
• scientific article; zbMATH DE number 3980933
• An objective-function ellipsoid-algorithm for convex quadraical programming

Cited in

(7)

• A deep cut ellipsoid algorithm for convex programming: Theory and applications
• Quasiconvex optimization and location theory
• Generalized fractional programming and cutting plane algorithms
• General models in min-max continuous location: Theory and solution techniques
• Using deep cuts in an ellipsoid algorithm for nonlinear programming
• scientific article; zbMATH DE number 1329060 (Why is no real title available?)
• A subgradient supported ellipsoid method for convex multiobjective optimization problems

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 Q4296824)