scientific article; zbMATH DE number 757681
From MaRDI portal
Publication:4833810
zbMath0833.90105MaRDI QIDQ4833810
Brigitte Jaumard, Pierre Hansen
Publication date: 23 May 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
global optimizationconvergenceLipschitz optimizationbranch-and-boundnumber of iterationsupper-bounding function
Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (25)
Utility function programs and optimization over the efficient set in multiple-objective decision making ⋮ Univariate global optimization with multiextremal non-differentiable constraints without penalty functions ⋮ Solving a huff-like competitive location and design model for profit maximization in the plane ⋮ Challenges of continuous global optimization in molecular structure prediction ⋮ Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure ⋮ Efficient methods for stochastic joint replenishment and delivery problem ⋮ P-algorithm based on a simplicial statistical model of multimodal functions ⋮ Metaheuristic vs. deterministic global optimization algorithms: the univariate case ⋮ Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation ⋮ Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods ⋮ On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales ⋮ On a global optimization algorithm for bivariate smooth functions ⋮ Hausdorff matching and Lipschitz optimization ⋮ Obtaining an outer approximation of the efficient set of nonlinear biobjective problems ⋮ When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation ⋮ A new global optimization method for univariate constrained twice-differentiable NLP problems ⋮ On convergence rate of a rectangular partition based global optimization algorithm ⋮ Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds ⋮ TRIOPT: A triangulation-based partitioning algorithm for global optimization ⋮ Aggregation functions based on penalties ⋮ The DIRECT algorithm: 25 years later ⋮ Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization ⋮ Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers ⋮ A Lipschitz Matrix for Parameter Reduction in Computational Science ⋮ A decomposition method for MINLPs with Lipschitz continuous nonlinearities
This page was built for publication:
