A new iterative method for solution of the dual problem of geometric programming

• Autorzy: Yatsko, A. , Sudakov, R.
• Języki publikacji: EN

Abstrakty

EN

In this article a new method of optimal solution of the dual problem is proposed. This method is based on Newton's attraction theorem. An estimate of iteration convergence is given. The method uses some new procedure of correction of the current iteration. It is shown that the method uses matrix operations at each step of calculations and has a quadric speed of the convergence.

Słowa kluczowe

PL

programowanie geometryczne; układy nieliniowe; iteracja

EN

geometric programming; nonlinear systems; iteration

• Czasopismo: Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
• Rocznik: 2007
• Tom: Vol. 12
• Strony: 115-120
• Opis fizyczny: Bibliogr. 3 poz.

Twórcy

autor

Yatsko, A.

• Chair of Mathematics, Technical University of Koszalin Śniadeckich 2, 75-453 Koszalin, Poland,

autor

Sudakov, R.

• Dorodnicyn Computing Centre Russian Academy of Sciences str. Vavilova 40, 119333 Moscow, Russia

Bibliografia

• [1] R.S. Sudakov, A.I. Yatsko. Elements of Applied Theory of Geometric Programming. Znanie, Moscow, 2004.
• [2] G. Ortega, R. Verner. Iterative Methods for Solution of Nonlinear Systems of Equalities with Many Unknowns. Mir, Moscow, 1976.
• [3] A.I. Yatsko. System Interval Analysis. Elements of the Theory and Applications. Znanie, Moscow, 2005.