Error bounds for mixed integer nonlinear optimization problems
From MaRDI portal
Recommendations
- Error bounds for mixed integer linear optimization problems
- Bounds on the objective value of feasible roundings
- The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities
- Approximation properties and tight bounds for constrained mixed-integer optimal control
- The integer approximation error in mixed-integer optimal control
Cites work
- scientific article; zbMATH DE number 3835772 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 1328979 (Why is no real title available?)
- scientific article; zbMATH DE number 1821400 (Why is no real title available?)
- 50 Years of Integer Programming 1958-2008
- A Condition Number for Differentiable Convex Inequalities
- A survey on error bounds for lower semicontinuous functions
- An Application of Error Bounds for Convex Programming in a Linear Space
- Approximations to Solutions to Systems of Linear Inequalities
- Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces
- Error bounds for analytic systems and their applications
- Error bounds in mathematical programming
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Global Regularity Theorems
- Global error bounds for piecewise convex polynomials
- Integer Rounding for Polymatroid and Branching Optimization Problems
- Interval Methods for Systems of Equations
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- Sensitivity theorems in integer linear programming
- Stability of error bounds for semi-infinite convex constraint systems
Cited in
(10)- Error bounds for initial value problems by optimization
- On Local Error Bound in Nonlinear Programs
- Error bounds and finite termination for constrained optimization problems
- Granularity in nonlinear mixed-integer optimization
- A feasible rounding approach for mixed-integer optimization problems
- Bounds on the objective value of feasible roundings
- Approximation properties and tight bounds for constrained mixed-integer optimal control
- Error bounds for mixed integer linear optimization problems
- Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts
- The gap function: evaluating integer programming models over multiple right-hand sides
This page was built for publication: Error bounds for mixed integer nonlinear optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q315475)
