scientific article; zbMATH DE number 757674
From MaRDI portal
Publication:4833803
zbMath0836.90138MaRDI QIDQ4833803
Publication date: 23 May 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (18)
The robust constant and its applications in random global search for unconstrained global optimization ⋮ Studies of multi-start clustering for global optimization ⋮ A MIQCP formulation for B-spline constraints ⋮ Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients ⋮ The Robust Constant and Its Applications in Global Optimization ⋮ On the convergence rate issues of general Markov search for global minimum ⋮ Approximation algorithm for a class of global optimization problems ⋮ On the Asymptotic Tractability of Global Optimization ⋮ Quantitative measure of nonconvexity for black-box continuous functions ⋮ Global optimization problems and domain reduction strategies ⋮ SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework ⋮ An adaptive procedure for the global minimization of a class of polynomial functions ⋮ Properties and numerical testing of a parallel global optimization algorithm ⋮ Dynamic search trajectory methods for global optimization ⋮ Hybrid control for tracking environmental level sets by nonholonomic robots in maze-like environments ⋮ 2U: an exact interval propagation algorithm for polytrees with binary variables ⋮ Conflict Analysis for MINLP ⋮ A Lipschitz Matrix for Parameter Reduction in Computational Science
This page was built for publication:
