Signomial dual Kuhn-Tucker intervals

DOI10.1007/BF00933598zbMath0422.90071OpenAlexW4232519678MaRDI QIDQ1134014

D. J. Wilde, L. J. Mancini

Publication date: 1979

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

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

zbMATH Keywords

Newton's methodinterval analysisglobal solutionnonlinear programminginterval arithmeticnonlinear equationsequilibrium conditionsgeometric programmingsignomial programminginterval Newton operatorapproximate dual solutionbranch- and-bound algorithmssignomial dual Kuhn-Tucker intervals

Mathematics Subject Classification ID

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

Related Items

What can interval analysis do for global optimization?

Cites Work

• Unnamed Item
• Unnamed Item
• Mass action and polynomial optimization
• On the solution of linear algebraic equations with interval coefficients
• Geometric programming with signomials
• Computable error bounds for nonlinear programming
• Generalized Polynomial Optimization
• Duality Theory for Geometric Programming
• Interval Arithmetic in Matrix Computations, Part II