Pages that link to "Item:Q1590262"
From MaRDI portal
The following pages link to Global optimization with non-convex constraints. Sequential and parallel algorithms (Q1590262):
Displaying 50 items.
- 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)
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves (Q1754461) (← 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)
- Generation of symmetric exponential sums (Q1881324) (← links)
- An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions (Q1935284) (← links)
- A deterministic approach to global box-constrained optimization (Q1947630) (← links)
- An information global minimization algorithm using the local improvement technique (Q1959236) (← links)
- On simulation of optimal strategies and Nash equilibrium in the financial market context (Q1959239) (← links)
- On computational search for optimistic solutions in bilevel problems (Q1959241) (← links)
- A partition-based global optimization algorithm (Q1959242) (← links)
- Iterative regularization algorithms for constrained image deblurring on graphics processors (Q1959245) (← links)
- On similarities between two models of global optimization: Statistical models and radial basis functions (Q1959246) (← links)
- A local search method for continuous global optimization (Q1959248) (← links)
- A genetic algorithm for a global optimization problem arising in the detection of gravitational waves (Q1959252) (← links)
- Stopping rules in \(k\)-adaptive global random search algorithms (Q1959253) (← links)
- A lower bound on convergence rates of nonadaptive algorithms for univariate optimization with noise (Q1959254) (← links)
- Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives (Q1962986) (← links)
- Distributed balanced partitioning via linear embedding (Q2005567) (← links)
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (Q2018512) (← links)
- On the extension of the \textsc{direct} algorithm to multiple objectives (Q2022240) (← links)
- The DIRECT algorithm: 25 years later (Q2022319) (← links)
- Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems (Q2046391) (← links)
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints (Q2047183) (← links)
- On a new smoothing technique for non-smooth, non-convex optimization (Q2061308) (← links)
- A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations (Q2089889) (← links)
- Hybrid global search algorithm with genetic blocks for solving hexamatrix games (Q2097315) (← links)
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems (Q2117623) (← links)
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game (Q2117635) (← links)
- Optimistic NAUTILUS navigator for multiobjective optimization with costly function evaluations (Q2154461) (← links)
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints (Q2156486) (← links)
- Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework (Q2156906) (← links)
- On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization (Q2199619) (← links)
- Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives (Q2199788) (← links)
- A hybrid of Bayesian approach based global search with clustering aided local refinement (Q2206585) (← links)
- Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms (Q2229118) (← links)
- Computationally efficient approach for solving lexicographic multicriteria optimization problems (Q2230779) (← links)
- Simplicial Lipschitz optimization without the Lipschitz constant (Q2249819) (← links)
- Globally-biased disimpl algorithm for expensive global optimization (Q2250095) (← links)
- Bi-objective decision making in global optimization based on statistical models (Q2274848) (← links)
- On efficiency of a single variable bi-objective optimization algorithm (Q2300650) (← links)
- Multidimensional global extremum seeking via the DIRECT optimisation algorithm (Q2356647) (← links)
- A hybrid global optimization algorithm for nonlinear least squares regression (Q2392764) (← links)
- Iterative MC-algorithm to solve the global optimization problems (Q2397267) (← links)
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case (Q2422871) (← links)
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes (Q2422874) (← links)
