A primal-dual Newton-type algorithm for geometric programs with equality constraints

DOI10.1007/BF00940759zbMath0573.90078MaRDI QIDQ1062918

A. Gonen, Mordecai Avriel

Publication date: 1986

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

Newton's methodequality constraintscomputational experienceaugmented Lagrangian algorithmcomplexity of the algorithmlocal solutions of geometric programmingrandom problem generator

Mathematics Subject Classification ID

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

Related Items (1)

On geometric programming and complementary slackness

Uses Software

• SPSS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiplier methods: A survey
• Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
• Decomposition of a symmetric matrix
• Comparison of generalized geometric programming algorithms
• A stable approach to Newton's method for general mathematical programming problems in R\(^n\)
• Multiplier and gradient methods
• A multiplier method with automatic limitation of penalty growth
• Consistency, Superconsistency, and Dual Degeneracy in Posynomial Geometric Programming
• Algorithms for nonlinear constraints that use lagrangian functions
• Reporting computational experiments in mathematical programming

This page was built for publication: A primal-dual Newton-type algorithm for geometric programs with equality constraints