Pages that link to "Item:Q5470225"
From MaRDI portal
The following pages link to Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants (Q5470225):
Displayed 50 items.
- A new expected-improvement algorithm for continuous minimax optimization (Q280101) (← links)
- Parallel global optimization on GPU (Q330491) (← links)
- Global search perspectives for multiobjective optimization (Q377750) (← links)
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function (Q386486) (← links)
- Lipschitz global optimization methods in control problems (Q386913) (← links)
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme (Q433950) (← links)
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria (Q460659) (← links)
- A one-step worst-case optimal algorithm for bi-objective univariate optimization (Q476260) (← links)
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization (Q506481) (← links)
- Improving the convergence rate of the DIRECT global optimization algorithm (Q522279) (← links)
- MSO: a framework for bound-constrained black-box global optimization algorithms (Q524912) (← links)
- Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity (Q537877) (← links)
- P-algorithm based on a simplicial statistical model of multimodal functions (Q621736) (← links)
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming (Q691482) (← links)
- Filter-based DIRECT method for constrained global optimization (Q721164) (← links)
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants (Q727093) (← links)
- Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces (Q746814) (← links)
- Diagonal generalizaton of the DIRECT method for problems with constraints (Q828532) (← links)
- A deterministic global optimization using smooth diagonal auxiliary functions (Q907200) (← links)
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds (Q968007) (← links)
- Lipschitz and Hölder global optimization using space-filling curves (Q969306) (← links)
- A univariate global search working with a set of Lipschitz constants for the first derivative (Q1024739) (← links)
- Multidimensional Lipschitz global optimization based on efficient diagonal partitions (Q1029568) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set (Q1675572) (← links)
- Geodesic and contour optimization using conformal mapping (Q1675629) (← links)
- Inferring large graphs using \(\ell_1\)-penalized likelihood (Q1704026) (← links)
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems (Q1713205) (← links)
- A direct search algorithm for global optimization (Q1736805) (← links)
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants (Q1754443) (← links)
- Solving a set of global optimization problems by the parallel technique with uniform convergence (Q1754445) (← links)
- Efficient multicriterial optimization based on intensive reuse of search information (Q1754449) (← links)
- An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section (Q1754452) (← links)
- Approximating a solution set of nonlinear inequalities (Q1754455) (← links)
- On convergence rate of a rectangular partition based global optimization algorithm (Q1754460) (← links)
- Bayesian optimization of pump operations in water distribution systems (Q1754464) (← links)
- A multi-objective \textbf{DIRECT} algorithm for ship hull optimization (Q1790670) (← links)
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} (Q1800457) (← links)
- A partition-based global optimization algorithm (Q1959242) (← links)
- On the extension of the \textsc{direct} algorithm to multiple objectives (Q2022240) (← links)
- A \textsc{direct}-type global optimization algorithm for image registration (Q2022242) (← links)
- The DIRECT algorithm: 25 years later (Q2022319) (← links)
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints (Q2047183) (← links)
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints (Q2156486) (← links)
- A hybrid of Bayesian approach based global search with clustering aided local refinement (Q2206585) (← links)
- Simplicial Lipschitz optimization without the Lipschitz constant (Q2249819) (← links)
- Globally-biased disimpl algorithm for expensive global optimization (Q2250095) (← links)
- A hybrid global optimization algorithm for nonlinear least squares regression (Q2392764) (← links)
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization (Q2397824) (← links)
- Combining global and local strategies to optimize parameters in magnetic spacecraft control via attitude feedback (Q2420825) (← links)