Computational aspects of cutting-plane algorithms for geometric programming problems
From MaRDI portal
Publication:4149242
DOI10.1007/BF01584337zbMath0372.90108OpenAlexW1972563079MaRDI QIDQ4149242
Gary A. Kochenberger, William H. Elliott, 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
Related Items
The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm, Some outer approximation methods for semi-infinite optimization problems, A cutting-plane algorithm with linear and geometric rates of convergence, Some remarks on condensation methods for geometric programs, On the computational utility of posynomial geometric programming solution methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Newton's method for convex programming and Tschebyscheff approximation
- A modified convace simplex algorithm for geometric programming
- Convex Programming by Tangential Approximation
- The Cutting-Plane Method for Solving Convex Programs
- Accelerating the Cutting Plane Method for Nonlinear Programming
- Solution of generalized geometric programs
- A central cutting plane algorithm for the convex programming problem
- Complementary Geometric Programming
- An Easy Primal Method for Geometric Programming
- Primal Geometric Programs Treated by Linear Programming
- A condensation method for generalized geometric programming
- A linear programming approach to geometric programs
- An approach to the numerical solutions of geometric programs
- The Supporting Hyperplane Method for Unimodal Programming
- Cutting-Plane Methods without Nested Constraint Sets
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
- Linearizing Geometric Programs
