An application of the nonuniform covering method to global optimization of mixed integer nonlinear problems
From MaRDI portal
Publication:2898193
DOI10.1134/S0965542511080082zbMath1249.90204MaRDI QIDQ2898193
Mikhail A. Posypkin, Yuri G. Evtushenko
Publication date: 16 July 2012
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
global optimizationnonlinear programmingobjective functionHessian matrixnonuniform covering methodpartial integrality conditions
Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31)
Related Items
On upper approximations of Pareto fronts, Ersatz function method for minimizing a finite-valued function on a compact set, Lipschitz global optimization methods in control problems, Method of non-uniform coverages to solve the multicriteria optimization problems with guaranteed accuracy, Comparison of parallel implementations of the branch-and-bound method for shared memory systems, A deterministic global optimization using smooth diagonal auxiliary functions, Lipschitz gradients for global optimization in a one-point-based partitioning scheme, Application of optimization methods for finding equilibrium states of two-dimensional crystals, Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties