Global minimization by reducing the duality gap
From MaRDI portal
Publication:1322556
DOI10.1007/BF01582066zbMath0807.90101OpenAlexW1967871541MaRDI QIDQ1322556
Gideon Eiger, Vladimir Gershovitz, Aharon Ben-Tal
Publication date: 19 February 1995
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582066
branch-and-boundduality gaplower boundsglobal minimumLagrange dual problemlinear semi-infinite problems
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)
Related Items
Natural gas production network infrastructure development under uncertainty, Integrated planning for design and production in two-stage recycling operations, A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints, Pooling problems with polynomial-time algorithms, Analysis of MILP Techniques for the Pooling Problem, Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, Large-scale standard pooling problems with constrained pools and fixed demands, A multi-commodity flow formulation for the generalized pooling problem, Strong formulations for the pooling problem, A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem, Complexity analysis and algorithm design of pooling problem, \(\alpha BB\): A global optimization method for general constrained nonconvex problems, Lagrange duality and partitioning techniques in nonconvex global optimization, Tightening methods based on nontrivial bounds on bilinear terms, GLOMIQO: global mixed-integer quadratic optimizer, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, Convergence-order analysis of branch-and-bound algorithms for constrained problems, A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, On the effectiveness of sequential linear programming for the pooling problem, Comparison of MINLP formulations for global superstructure optimization, Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms, Strong Convex Nonlinear Relaxations of the Pooling Problem, Active set strategies in an ellipsoid algorithm for nonlinear programming, A cost minimization heuristic for the pooling problem, Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program, On a decomposition method for nonconvex global optimization, Decision-dependent probabilities in stochastic programs with recourse, A polynomially solvable case of the pooling problem, Relaxations and discretizations for the pooling problem, New multi-commodity flow formulations for the pooling problem, Duality bound method for the general quadratic programming problem with quadratic constraints, A global supply chain model with transfer pricing and transportation cost allocation, Decomposition-based inner- and outer-refinement algorithms for global optimization, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods, Extended duality for nonlinear programming, On solving nonconvex optimization problems by reducing the duality gap, The computational complexity of the pooling problem, Feasibility and cost minimisation for a lithium extraction problem, A new Lagrangean approach to the pooling problem, Modeling and design of global logistics systems: a review of integrated strategic and tactical models and design algorithms, Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints, New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
Cites Work
- A collection of test problems for constrained global optimization algorithms
- Primal-relaxed dual global optimization approach
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A Decomposition Strategy for Global Optimum Search in the Pooling Problem
- State Constraints in Convex Control Problems of Bolza
- Unnamed Item
- Unnamed Item
- Unnamed Item
