A primal-dual Newton-type algorithm for geometric programs with equality constraints-Reference-Cited by-同舟云学术

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

Published:1986-05 Issue:2 Volume:49 Page:239-269
ISSN:0022-3239
Container-title:Journal of Optimization Theory and Applications
language:en
Short-container-title:J Optim Theory Appl

Author:

Gonen A.,Avriel M.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Management Science and Operations Research,Control and Optimization

Link

http://link.springer.com/content/pdf/10.1007/BF00940759.pdf

Reference24 articles.

1. Tapia, R. A.,Diagonalized Multiplier Methods and Quasi-Newton Methods for Constrained Optimization, Journal of Optimization Theory and Applications, Vol. 22, pp. 135?194, 1977.

2. Blau, G. E., andWilde, D. J.,A Lagrangian Algorithm for Equality Constrained Generalized Polynomial Optimization, AIChE Journal, Vol. 17, pp. 235?240, 1971.

3. Rijckaert, M. J.,Engineering Applications of Geometric Programming, Part 2, Optimization and Design, Edited by M. Avriel, M. J. Rijckaert, and D. J. Wilde, Prentice-Hall, Englewood Cliffs, New Jersey, 1971.

4. Rijckaert, M. J., andMartens, X. M.,A Comparison of Generalized Geometric Programming Algorithms, Journal of Optimization Theory and Applications, Vol. 26, pp. 205?242, 1978.

5. Abrams, R. A.,Consistency, Superconsistency, and Dual Degeneracy in Posynomial Geometric Programming, Operations Research, Vol. 24, pp. 325?335, 1976.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Processing Partial Information in Decision Support Systems;From Data to Knowledge;1996

2. On geometric programming and complementary slackness;Journal of Optimization Theory and Applications;1992-08