Computable error bounds for an optimization problem with parallelepiped constraint
From MaRDI portal
Publication:1899951
DOI10.1016/0377-0427(93)E0201-VzbMATH Open0834.65049MaRDI QIDQ1899951FDOQ1899951
Authors: Ismail Mohd 
Publication date: 20 November 1995
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Recommendations
- Computable bounds on parametric solutions of convex problems
- Computable error bounds for semidefinite programming
- Error bounds and finite termination for constrained optimization problems
- Convex optimization with computational errors
- Two error bounds for constrained optimization problems and their applications
- scientific article; zbMATH DE number 841069
- Error bounds and multipliers in constrained optimization problems with tolerance
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- A strict complementarity approach to error bound and sensitivity of solution of conic programs
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An interval arithmetic method for global optimization
- An interval global optimization algorithm for a class of functions with several variables
- On Solving Systems of Equations Using Interval Arithmetic
- Using Interval Methods for the Numerical Solution of ODE's
- Unconstrained global optimization using strict complementary slackness
- Computable error bounds for nonlinear programming
Cited In (3)
This page was built for publication: Computable error bounds for an optimization problem with parallelepiped constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899951)
