scientific article; zbMATH DE number 4172771

MaRDI QIDQ3197635zbMATH OpenFDO

Authors E. A. Sideri

Publication date 1990

zbMATH Keywords

cutting plane algorithmdifference of two convex functionsKelley's convex programmingpseudoconex functionsrate of convergence

Mathematics Subject Classification ID

Convexity of real functions of several variables, generalizations (26B25) Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Fractional programming (90C32)

Recommendations

• scientific article; zbMATH DE number 3904352
• A sequential cutting plane algorithm for solving convex NLP problems
• scientific article; zbMATH DE number 4095213
• A Practical Geometrically Convergent Cutting Plane Algorithm
• Modified cutting plane method for minimization of a convex function

Cited in

(8)

• A sequential cutting plane algorithm for solving convex NLP problems
• scientific article; zbMATH DE number 4176856 (Why is no real title available?)
• An optimal variant of Kelley's cutting-plane method
• scientific article; zbMATH DE number 3904352 (Why is no real title available?)
• scientific article; zbMATH DE number 3948004 (Why is no real title available?)
• scientific article; zbMATH DE number 4095213 (Why is no real title available?)
• A Cutting Plane Algorithm for Min-Max Fractional Programming
• A Practical Geometrically Convergent Cutting Plane Algorithm

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)