Computable error bounds for an optimization problem with parallelepiped constraint

DOI10.1016/0377-0427(93)E0201-VzbMath0834.65049MaRDI QIDQ1899951

Ismail Bin Mohd

Publication date: 20 November 1995

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

interval arithmeticcomputable error boundsKuhn-Tucker pointparallelepiped constraint

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unconstrained global optimization using strict complementary slackness
• An interval arithmetic method for global optimization
• An interval global optimization algorithm for a class of functions with several variables
• Using Interval Methods for the Numerical Solution of ODE's
• Computable error bounds for nonlinear programming
• On Solving Systems of Equations Using Interval Arithmetic

This page was built for publication: Computable error bounds for an optimization problem with parallelepiped constraint