Results 71 to 80 of about 24,807 (199)
MathematicsThe reentry trajectory planning problem of hypersonic vehicles is generally a continuous and nonconvex optimization problem, and it constitutes a critical challenge within the field of aerospace engineering.
Haizhao Liang +4 more
doaj +1 more source
TDOA-Based Source Collaborative Localization via Semidefinite Relaxation in Sensor Networks
International Journal of Distributed Sensor Networks, 2015 The time delay of arrival- (TDOA-) based source localization using a wireless sensor network has been considered in this paper. The maximum likelihood estimate (MLE) is formulated by taking the correlated TDOA noise into account, which is caused by the ...
Yongsheng Yan +4 more
doaj +1 more source
Spatial Image Gradient Estimation From the Diffusion MRI Profile
Magnetic Resonance in Medicine, Volume 95, Issue 5, Page 2980-2991, May 2026.ABSTRACT Purpose In the course of diffusion, water molecules encounter varying values for the relaxation‐time properties of the underlying tissue. This factor, which has rarely been accounted for in diffusion MRI (dMRI), is modeled in this work, allowing for the estimation of the gradient of relaxation‐time properties from the dMRI signal. Methods With
Iman Aganj +4 more
wiley +1 more source
Optimal Network Topology for Node-Breaker Representations With AC Power Flow Constraints
IEEE Access, 2020 It has been demonstrated that network topology optimization (NTO) may change the topology of power system networks, and consequently, provide additional flexibility to reduce network congestion and violations.
Byungkwon Park, Christopher L. Demarco
doaj +1 more source
Stabilizing Extreme Few‐Shot ECG Classification via Self‐Supervised Contrastive Pretraining
Annals of Noninvasive Electrocardiology, Volume 31, Issue 3, May 2026.Under extreme few‐shot ECG classification, supervised training frequently collapses to degenerate solutions. Self‐supervised pretraining stabilizes optimization, eliminates early collapse, and enables reproducible multi‐class rhythm classification with limited labeled data. ABSTRACT In clinical electrocardiogram (ECG) analysis, high‐quality annotations
LiuPing Zeng +3 more
wiley +1 more source
Quantum Time‐Marching Algorithms for Solving Linear Transport Problems Including Boundary Conditions
International Journal for Numerical Methods in Engineering, Volume 127, Issue 8, 30 April 2026.ABSTRACT This article presents the first complete application of a quantum time‐marching algorithm for simulating multidimensional linear transport phenomena with arbitrary boundaries, whereby the success probabilities are problem intrinsic. The method adapts the linear combination of unitaries algorithm to block encode the diffusive dynamics, while ...
Sergio Bengoechea +2 more
wiley +1 more source
Results in Control and OptimizationIn this article, we study nonconvex multiobjective fractional programming problems involving E-differentiable functions (MFPE). We establish the E-Karush–Kuhn–Tucker (E-KKT) sufficient E-optimality conditions for nonsmooth vector optimization problems ...
Dhruv Singh +3 more
doaj +1 more source
CHARACTERISING SOLUTION SET OF A NONCONVEX PROGRAMMING PROBLEM VIA ITS DUAL PROBLEMS
Tạp chí Khoa học Đại học Đà Lạt, 2012 Using duality theory, we propose a new approach to characterise solution set of a nonconvex optimisation problem. Several characterisations of solution set of the problem are established via it s dual problems.
Do Sang Kim, Tạ Quang Sơn
doaj +1 more source
Robust Inverse Material Design With Physical Guarantees Using the Voigt‐Reuss Net
International Journal for Numerical Methods in Engineering, Volume 127, Issue 7, 15 April 2026.ABSTRACT We apply the Voigt‐Reuss net, a spectrally normalized neural surrogate introduced in [38], for forward and inverse mechanical homogenization with a key guarantee that all predicted effective stiffness tensors satisfy Voigt‐Reuss bounds in the Löwner sense during training, inference, and gradient‐driven optimization.
Sanath Keshav, Felix Fritzen
wiley +1 more source
A local branching heuristic for MINLPs
, 2008 Local branching is an improvement heuristic, developed within the context of branch-and-bound algorithms for MILPs, which has proved to be very effective in practice.
Belotti, Pietro +2 more
core +1 more source