scientific article; zbMATH DE number 4172771
zbMATH Open0712.90080MaRDI QIDQ3197635FDOQ3197635
Publication date: 1990
Title of this publication is not available (Why is that?)
rate of convergencedifference of two convex functionscutting plane algorithmKelley's convex programmingpseudoconex functions
Numerical mathematical programming methods (65K05) Fractional programming (90C32) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Convexity of real functions of several variables, generalizations (26B25)
Cited In (1)
Recommendations
- Title not available (Why is that?) π π
- A sequential cutting plane algorithm for solving convex NLP problems π π
- Title not available (Why is that?) π π
- A Practical Geometrically Convergent Cutting Plane Algorithm π π
- Modified cutting plane method for minimization of a convex function π π
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 Q3197635)