A class of problems where dual bounds beat underestimation bounds
From MaRDI portal
Publication:598587
DOI10.1023/A:1013890609372zbMATH Open1045.90078OpenAlexW1605156146MaRDI QIDQ598587FDOQ598587
Authors: Mirjam Dür 
Publication date: 12 August 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013890609372
Recommendations
- Exact dual bounds for some nonconvex minimax quadratic optimization problems
- scientific article; zbMATH DE number 16323
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- The Convex Envelope of (n–1)-Convex Functions
- On the Duality Gap in Nonconvex Optimization
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cited In (11)
- Convergent upper bounds in global minimization with nonlinear equality constraints
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Global optimization of disjunctive programs
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- Tight bounds for double coverage against weak adversaries
- On the relation between concavity cuts and the surrogate dual for convex maximization problems
- Bounding duality gap for separable problems with linear constraints
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- Tight Bounds for Double Coverage Against Weak Adversaries
- A branch-and-bound algorithm for nonconvex Nash equilibrium problems
- Dual lower bounds for approximate degree and Markov-Bernstein inequalities
This page was built for publication: A class of problems where dual bounds beat underestimation bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598587)
