Second order algorithms for the posynomial geometric programming dual, part I: Analysis

DOI10.1007/BF01588241zbMath0415.90070MaRDI QIDQ3205030

Ron S. Dembo

Publication date: 1979

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

nonlinear programming; geometric programming; second order methods; Newton algorithms; general continuous nonlinear programs; linearly-constrained dual posynomial programming problems; nondifferentiability problem; posynomial approximations

Mathematics Subject Classification ID

90C30: Nonlinear programming

90C99: Mathematical programming

Related Items

A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier, Geometric programming. Method and applications, Sensitivity analysis in geometric programming, Current state of the art of algorithms and computer software for geometric programming, Second order algorithms for the posynomial geometric programming dual, part I: Analysis, Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras, On solving a primal geometric program by partial dual optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modified reduced gradient method for dual posynomial programming
• Current state of the art of algorithms and computer software for geometric programming
• Dual to primal conversion in geometric programming
• Second order algorithms for the posynomial geometric programming dual, part I: Analysis
• Newton-type methods for unconstrained and linearly constrained optimization
• A condensation method for generalized geometric programming
• Large-scale linearly constrained optimization
• A numerical study of multiplier methods for constrained parameter optimization
• An approach to the numerical solutions of geometric programs
• A new method for the optimization of a nonlinear function subject to nonlinear constraints