scientific article; zbMATH DE number 2205701
From MaRDI portal
Publication:5317017
zbMath1083.90524MaRDI QIDQ5317017
Yaroslav D. Sergeyev, Dmitri E. Kvasov
Publication date: 15 September 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
diagonal algorithmsglobal convergenceLipschitz conditionadaptive diagonal curvesmultidimensional global optimization algorithm
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)
Related Items (10)
Adaptive nested optimization scheme for multidimensional global search ⋮ On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization ⋮ Numerical methods using two different approximations of space-filling curves for black-box global optimization ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ Lipschitz gradients for global optimization in a one-point-based partitioning scheme ⋮ On total preservation of solvability of controlled Hammerstein-type equation with non-isotone and non-majorizable operator ⋮ Application of optimization methods for finding equilibrium states of two-dimensional crystals ⋮ A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem ⋮ Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces ⋮ On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
This page was built for publication:
