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

DOI10.1007/BF01588241zbMath0415.90070OpenAlexW2057448751MaRDI QIDQ3205030

Ron S. Dembo

Publication date: 1979

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

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

zbMATH Keywords

nonlinear programminggeometric programmingsecond order methodsNewton algorithmsgeneral continuous nonlinear programslinearly-constrained dual posynomial programming problemsnondifferentiability problemposynomial approximations

Mathematics Subject Classification ID

Nonlinear programming (90C30) Mathematical programming (90C99)

Related Items

Second order algorithms for the posynomial geometric programming dual, part I: Analysis, Geometric programming. Method and applications, A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier, Sensitivity analysis in geometric programming, Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras, Current state of the art of algorithms and computer software for geometric programming, 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