Computational aspects of cutting-plane algorithms for geometric programming problems

DOI10.1007/BF01584337MaRDI QIDQ4149242zbMATH OpenOpenAlexFDO

Authors William H. Elliott, Gary A. Kochenberger, John J. Dinkel

Publication date 1977

Published in Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites work

• A central cutting plane algorithm for the convex programming problem
• A condensation method for generalized geometric programming
• A linear programming approach to geometric programs
• A modified convace simplex algorithm for geometric programming
• Accelerating the Cutting Plane Method for Nonlinear Programming
• An approach to the numerical solutions of geometric programs
• An Easy Primal Method for Geometric Programming
• Complementary Geometric Programming
• Convex programming by tangential approximation
• Cutting-Plane Methods without Nested Constraint Sets
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• scientific article; zbMATH DE number 3175708 (Why is no real title available?)
• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3272827 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• scientific article; zbMATH DE number 3382096 (Why is no real title available?)
• Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
• Linearizing Geometric Programs
• Newton's method for convex programming and Tschebyscheff approximation
• Primal Geometric Programs Treated by Linear Programming
• Solution of generalized geometric programs
• The Cutting-Plane Method for Solving Convex Programs
• The Supporting Hyperplane Method for Unimodal Programming

Cited in

(5)

• The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
• A cutting-plane algorithm with linear and geometric rates of convergence
• Some outer approximation methods for semi-infinite optimization problems
• On the computational utility of posynomial geometric programming solution methods
• Some remarks on condensation methods for geometric programs

This page was built for publication: Computational aspects of cutting-plane algorithms for geometric programming problems

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