Results 61 to 70 of about 108,734 (233)
Gaussian Mean Fields Lattice Gas
We study rigorously a lattice gas version of the Sherrington-Kirckpatrick spin glass model. In discrete optimization literature this problem is known as Unconstrained Binary Quadratic Programming (UBQP) and it belongs to the class NP-hard.
Scoppola, Benedetto, Troiani, Alessio
core +1 more source
This work investigates the optimal initial data size for surrogate‐based active learning in functional material optimization. Using factorization machine (FM)‐based quadratic unconstrained binary optimization (QUBO) surrogates and averaged piecewise linear regression, we show that adequate initial data accelerates convergence, enhances efficiency, and ...
Seongmin Kim, In‐Saeng Suh
wiley +1 more source
Legged robots have advanced in environmental interaction through contact, but most works rely on fixed contact sequences. This work presents a new method based on an indirect optimization method for legged robots to automatically generate contact sequences for complex movements.
Yaowei Chen, Jie Zhang, Ming Lyu
wiley +1 more source
Qubit Reduction and Quantum Speedup for Wireless Channel Assignment Problem
In this article, we propose a novel method of formulating an NP-hard wireless channel assignment problem as a higher-order unconstrained binary optimization (HUBO), where the Grover adaptive search (GAS) is used to provide a quadratic speedup for solving
Yuki Sano +2 more
doaj +1 more source
Distributed Interior-point Method for Loosely Coupled Problems
In this paper, we put forth distributed algorithms for solving loosely coupled unconstrained and constrained optimization problems. Such problems are usually solved using algorithms that are based on a combination of decomposition and first order methods.
Andersen, Martin S. +2 more
core +1 more source
An Algorithm for Unconstrained Quadratically Penalized Convex Optimization [PDF]
A descent algorithm, "Quasi-Quadratic Minimization with Memory" (QQMM), is proposed for unconstrained minimization of the sum, $F$, of a non-negative convex function, $V$, and a quadratic form. Such problems come up in regularized estimation in machine learning and statistics. In addition to values of $F$, QQMM requires the (sub)gradient of $V$.
openaire +2 more sources
Risk‐aware safe reinforcement learning for control of stochastic linear systems
Abstract This paper presents a risk‐aware safe reinforcement learning (RL) control design for stochastic discrete‐time linear systems. Rather than using a safety certifier to myopically intervene with the RL controller, a risk‐informed safe controller is also learned besides the RL controller, and the RL and safe controllers are combined together ...
Babak Esmaeili +2 more
wiley +1 more source
Abstract The linear‐quadratic regulator (LQR) problem of optimal control of an uncertain discrete‐time linear system (DTLS) is revisited in this paper from the perspective of Tikhonov regularization. We show that an optimally chosen regularization parameter reduces, compared to the classical LQR, the values of a scalar error function, as well as the ...
Fernando Pazos, Amit Bhaya
wiley +1 more source
Particle algorithms for optimization on binary spaces
We discuss a unified approach to stochastic optimization of pseudo-Boolean objective functions based on particle methods, including the cross-entropy method and simulated annealing as special cases.
Schäfer, Christian
core +2 more sources
Pharmacokinetic profiles of sertraline in pregnancy as a predictor of postpartum depressive symptoms
Aim To characterize pharmacokinetic changes of sertraline and its metabolite during pregnancy and postpartum, and their relationship to maternal postpartum depressive symptoms. Methods This was a prospective observational, longitudinal study of pregnant women with a major depressive disorder treated with sertraline (N = 185 women, 205 pregnancies ...
Sílvia M. Illamola +8 more
wiley +1 more source

