Error bounds for mixed integer nonlinear optimization problems
From MaRDI portal
Publication:315475
DOI10.1007/S11590-016-1011-YzbMATH Open1377.90061OpenAlexW2258633420MaRDI QIDQ315475FDOQ315475
Authors: Oliver Stein 
Publication date: 21 September 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1011-y
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
- Title not available (Why is that?)
- Error bounds for analytic systems and their applications
- Error bounds in mathematical programming
- Global error bounds for piecewise convex polynomials
- Title not available (Why is that?)
- Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces
- 50 Years of Integer Programming 1958-2008
- Integer Rounding for Polymatroid and Branching Optimization Problems
- A Condition Number for Differentiable Convex Inequalities
- Sensitivity theorems in integer linear programming
- Global Regularity Theorems
- Interval Methods for Systems of Equations
- An Application of Error Bounds for Convex Programming in a Linear Space
- Title not available (Why is that?)
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
- Approximations to Solutions to Systems of Linear Inequalities
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- Title not available (Why is that?)
- A survey on error bounds for lower semicontinuous functions
- Stability of error bounds for semi-infinite convex constraint systems
Cited In (9)
- A feasible rounding approach for mixed-integer optimization problems
- Bounds on the objective value of feasible roundings
- Error bounds for initial value problems by optimization
- Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts
- Error bounds and finite termination for constrained optimization problems
- On Local Error Bound in Nonlinear Programs
- Approximation Properties and Tight Bounds for Constrained Mixed-Integer Optimal Control
- Granularity in nonlinear mixed-integer optimization
- 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)
