Global minimization by reducing the duality gap

Authors:
Aharon Ben-Tal;Gideon Eiger;Vladimir Gershovitz
Affiliations:
-;-;-
Venue:
Mathematical Programming: Series A and B
Year:
1994

Citing 0
Cited 12

Convergence and application of a decomposition method using duality bounds for nonconvex global optimization

Journal of Optimization Theory and Applications
Efficient and Adaptive Lagrange-Multiplier Methods for Nonlinear Continuous Global Optimization

Journal of Global Optimization
An Algorithm for Global Minimization of Linearly Constrained Quadratic Functions

Journal of Global Optimization
A note on reduction of quadratic and bilinear programs with equality constraints

Journal of Global Optimization
Convergence of duality bound method in partly convex programming

Journal of Global Optimization
A Global Optimization Algorithm using Lagrangian Underestimates and the Interval Newton Method

Journal of Global Optimization
Active set strategies in an ellipsoid algorithm for nonlinear programming

Computers and Operations Research
On Solving Nonconvex Optimization Problems by Reducing The Duality Gap

Journal of Global Optimization
Accelerating Branch-and-Bound through a Modeling Language Construct for Relaxation-Specific Constraints

Journal of Global Optimization
A new Lagrangean approach to the pooling problem

Journal of Global Optimization
Extended duality for nonlinear programming

Computational Optimization and Applications
GloMIQO: Global mixed-integer quadratic optimizer

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract