Results 111 to 120 of about 108,734 (233)
ABSTRACT The probabilistic surrogates used by Bayesian optimizers make them popular methods when function evaluations are noisy or expensive to evaluate. While Bayesian optimizers are traditionally used for global optimization, their benefits are also valuable for local optimization.
André L. Marchildon, David W. Zingg
wiley +1 more source
Reliable AI Platform for Monitoring BCI Caused Brain Injury and Providing Real‐Time Protection
BrainGuard enables real‐time and interpretable assessment of brain injury caused by brain computer interface (BCI). Using feature‐based Gaussian process (GP) emulators trained on limited biomechanical data, it efficiently predicts full‐field strain and constructs patient‐specific digital brain twins to support clinical diagnosis and long‐term BCI ...
Chufan He +3 more
wiley +1 more source
Improved New Two-Spectral Conjugate Gradient Iterative Technique for Large Scale Optimization
Numerous strategies have been proposed in the field of unconstrained optimization to address various optimization challenges, particularly those associated with large-scale systems. Among the classical methods, Newton and Quasi-Newton approaches are well-
Radhwan Basem Thanoon +1 more
doaj +1 more source
Quantum computing techniques such as Quantum Annealing and Quadratic Unconstrained Binary Optimization are effectively solving NP‐hard problems in operations management and research, particularly in logistics, manufacturing, and finance. This study maps these applications to present a framework for future adoption across industries. ABSTRACT This study
Daniel Bouzon Nagem Assad +3 more
wiley +1 more source
Characterization of Multimodality in Wind Farm Layout Optimization
ABSTRACT The phenomena of multiple optima in wind farm layout optimization (WFLO) problems is investigated. The choice of optimization algorithm and cost of solving WFLO problems is driven by the degree of local optimality in the design space; however little work has attempted to characterize this.
Daniel J. Poole
wiley +1 more source
A Polynomial-Time Algorithm for Unconstrained Binary Quadratic Optimization
In this paper, an exact algorithm in polynomial time is developed to solve unrestricted binary quadratic programs. The computational complexity is $O\left( n^{\frac{15}{2}}\right) $, although very conservative, it is sufficient to prove that this minimization problem is in the complexity class $P$.
openaire +2 more sources
Quantum annealing and its variants: application to quadratic unconstrained binary optimization
Published by RWTH Aachen University ...
openaire +3 more sources
This study proposes an elevation‐aware QUBO model that optimizes multi‐vehicle routes by jointly reducing fuel consumption and traffic congestion. By integrating gradient‐corrected Dijkstra routing with quantum annealing, the method achieves substantial fuel‐saving effects in hilly regions such as San Francisco and significantly decreases route overlap,
Tsubasa Suzuki, Takao Tomono
wiley +1 more source
Stabilizing Inference in Dirichlet Regression via Ridge‐Penalized Model
ABSTRACT We propose a penalized Dirichlet regression framework for modeling compositional data, using a softmax link to ensure that the mean vector lies on the simplex and to avoid log‐ratio transformations or zero replacement. The model is formulated in a GLM‐like setting and incorporates an ℓ2$$ {\mathrm{\ell}}_2 $$ (ridge) penalty on the regression ...
Andrea Nigri
wiley +1 more source
This study deals with basic prediction/estimation issues involving a constrained multivariate linear model (CMLM) and some related reduced models. By reparameterizing these models, the authors create unconstrained multivariate linear models (UMLMs ...
Melek Eriş Büyükkaya +1 more
doaj +1 more source

