Computable error bounds for an optimization problem with parallelepiped constraint
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- An interval arithmetic method for global optimization
- An interval global optimization algorithm for a class of functions with several variables
- Computable error bounds for nonlinear programming
- On Solving Systems of Equations Using Interval Arithmetic
- Unconstrained global optimization using strict complementary slackness
- Using Interval Methods for the Numerical Solution of ODE's
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)
