The following pages link to (Q2864120):
Displayed 50 items.
- A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm (Q286595) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Computational investigation of simple memetic approaches for continuous global optimization (Q342367) (← links)
- A filling function method for unconstrained global optimization (Q493693) (← links)
- A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision (Q721144) (← links)
- Working fluid selection for organic rankine cycles via deterministic global optimization of design and operation (Q779765) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
- Basin hopping networks of continuous global optimization problems (Q1642814) (← links)
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results (Q1657404) (← links)
- Generalized parallel computational schemes for time-consuming global optimization (Q1662785) (← links)
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations (Q1685576) (← links)
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems (Q1713205) (← links)
- Deterministic global optimization with artificial neural networks embedded (Q1730780) (← links)
- Efficient multicriterial optimization based on intensive reuse of search information (Q1754449) (← links)
- Parallel two-phase methods for global optimization on GPU (Q1997322) (← links)
- Incremental method for multiple line detection problem -- iterative reweighted approach (Q1998212) (← links)
- Basin hopping with synched multi L-BFGS local searches. Parallel implementation in multi-CPU and GPUs (Q2009548) (← links)
- Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
- Efficient large scale global optimization through clustering-based population methods (Q2027033) (← links)
- Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks (Q2045011) (← links)
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method (Q2046304) (← links)
- Deterministic global optimization with Gaussian processes embedded (Q2062323) (← links)
- Computationally efficient identification of continuous-time Lur'e-type systems with stability guarantees (Q2063779) (← links)
- Hopping between distant basins (Q2079697) (← links)
- On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints (Q2089868) (← links)
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems (Q2117623) (← links)
- Improved penalty algorithm for mixed integer PDE constrained optimization problems (Q2147266) (← links)
- Double descent and intermittent color diffusion for landscape exploration (Q2192577) (← links)
- Deterministic global optimization of steam cycles using the IAPWS-IF97 model (Q2218882) (← links)
- Global optimization for data assimilation in landslide tsunami models (Q2222990) (← links)
- Computationally efficient approach for solving lexicographic multicriteria optimization problems (Q2230779) (← links)
- Maximization of a PSD quadratic form and factorization (Q2230781) (← links)
- An algorithm for computing Fréchet means on the sphere (Q2329671) (← links)
- Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem (Q2423794) (← links)
- Global optimization issues in deep network regression: an overview (Q2633536) (← links)
- Optimising portfolio diversification and dimensionality (Q2679246) (← links)
- New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
- A consensus-based model for global optimization and its mean-field limit (Q2963631) (← links)
- Approximate Global Minimizers to Pairwise Interaction Problems via Convex Relaxation (Q4608088) (← links)
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization (Q4629343) (← links)
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831) (← links)
- Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers (Q4960952) (← links)
- Preisach based storage devices and global optimizers (Q5001274) (← links)
- Escaping local minima with local derivative-free methods: a numerical investigation (Q5093686) (← links)
- Multidimensional Global Search Using Numerical Estimations of Minimized Function Derivatives and Adaptive Nested Optimization Scheme (Q5122315) (← links)
- Clustering methods for large scale geometrical global optimization (Q5198058) (← links)
- Multidimensional global optimization using numerical estimates of objective function derivatives (Q5865327) (← links)
- Global optimization based on local searches (Q5920293) (← links)