scientific article; zbMATH DE number 4172771

zbMATH Open0712.90080MaRDI QIDQ3197635FDOQ3197635

Authors: E. A. Sideri 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

rate of convergencedifference of two convex functionscutting plane algorithmKelley's convex programmingpseudoconex functions

Mathematics Subject Classification ID

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 (8)

• Title not available (Why is that?)
• A Practical Geometrically Convergent Cutting Plane Algorithm
• A Cutting Plane Algorithm for Min-Max Fractional Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• An optimal variant of Kelley's cutting-plane method
• Title not available (Why is that?)
• A sequential cutting plane algorithm for solving convex NLP 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 Q3197635)