Pages that link to "Item:Q1906224"
From MaRDI portal
The following pages link to Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications (Q1906224):
Displayed 50 items.
- Iterative learning control based on extremum seeking (Q254596) (← links)
- Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations (Q284850) (← links)
- On the convergence of adaptive stochastic search methods for constrained and multi-objective black-box optimization (Q328457) (← links)
- Adaptive nested optimization scheme for multidimensional global search (Q330495) (← links)
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints (Q367165) (← 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)
- Robust optimization of graph partitioning involving interval uncertainty (Q443713) (← links)
- Interpretation and optimization of the \(k\)-means algorithm. (Q464720) (← links)
- A one-step worst-case optimal algorithm for bi-objective univariate optimization (Q476260) (← links)
- A study of singular spectrum analysis with global optimization techniques (Q480832) (← links)
- On a global optimization algorithm for bivariate smooth functions (Q481774) (← links)
- Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
- A filling function method for unconstrained global optimization (Q493693) (← links)
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- MSO: a framework for bound-constrained black-box global optimization algorithms (Q524912) (← links)
- Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization (Q613428) (← links)
- Optimizing the principal eigenvalue of the Laplacian in a sphere with interior traps (Q636404) (← links)
- Low dimensional simplex evolution: a new heuristic for global optimization (Q656836) (← links)
- Continuous global optimization through the generation of parametric curves (Q671196) (← links)
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants (Q727093) (← links)
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization (Q727229) (← links)
- Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces (Q746814) (← links)
- Adaptive global optimization based on a block-recursive dimensionality reduction scheme (Q828539) (← links)
- Challenges of continuous global optimization in molecular structure prediction (Q877606) (← links)
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems (Q907199) (← links)
- A deterministic global optimization using smooth diagonal auxiliary functions (Q907200) (← links)
- Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← 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)
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems (Q1029695) (← links)
- Linear and nonlinear system identification using separable least-squares (Q1306057) (← links)
- The barrier attribute of filled functions. (Q1426176) (← links)
- Evidence and credibility: Full Bayesian signifiance test for precise hypotheses (Q1612919) (← links)
- Always convergent methods for nonlinear equations of several variables (Q1646676) (← links)
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results (Q1657404) (← 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)
- On the convergence rate issues of general Markov search for global minimum (Q1685583) (← links)
- On existence of solutions for Boltzmann continuous slowing down transport equation (Q1688837) (← links)
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems (Q1713205) (← links)
- Visualization of a statistical approximation of the Pareto front (Q1732235) (← links)
- Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study (Q1749785) (← 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)
