Results 41 to 50 of about 7,288,186 (192)
Mathematical and Computer Modelling, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shao-Jian Qu, Ying Ji 0001, Ke-Cun Zhang
openaire +3 more sources
Artificial Intelligence for Engineering, EarlyView.Caputo‐based fPINNs accurately solve fractional ODEs and PDEs while exposing an accuracy–cost trade‐off driven by the history‐dependent fractional derivative. Temporal collocation and shorter time windows are the most effective strategies for improving early‐time accuracy without unnecessary spatial refinement.
Donya Dabiri +4 more
wiley +1 more source
Computational Optimization and ApplicationsWe use sensitivity analysis to design bounding-focused discretization (cutting-surface) methods for the global optimization of nonconvex semi-infinite programs (SIPs). We begin by formulating the optimal bounding-focused discretization of SIPs as a max-min problem and propose variants that are more computationally tractable.
Evren Mert Turan +2 more
openaire +4 more sources
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Generalisation is a crucial aspect of deep learning, enabling models to perform well on unseen data. Currently, most optimisers that improve generalisation typically suffer from efficiency bottlenecks. This paper proposes a double‐integration‐enhanced stochastic gradient descent (DIESGD) optimiser, which treats the negative gradient as an ...
Ting Li +3 more
wiley +1 more source
Outer Approximation Algorithms for DC Programs and Beyond [PDF]
, 2008 We consider the well-known Canonical DC (CDC) optimization problem, relying on an alternative equivalent formulation based on a polar characterization of the constraint, and a novel generalization of this problem, which we name Single Reverse Polar ...
ZHANG, QINGHUA
core +1 more source
High Voltage, EarlyView.ABSTRACT With the development of electric power artificial intelligence (AI) technology, many complicated challenges emerged during application. Traditional AI algorithms work well in specialised tasks such as detection and classification. However, they are unlikely to solve general problems.
Yuanpeng Tan +4 more
wiley +1 more source
BMC Bioinformatics, 2009 Background Optimization methods allow designing changes in a system so that specific goals are attained. These techniques are fundamental for metabolic engineering.
Sorribas Albert +1 more
doaj +1 more source
Computing Skinning Weights via Convex Duality
Computer Graphics Forum, EarlyView.We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley +1 more source
Remote SensingJoint transceiver beamforming is a fundamental and crucial research task in the field of signal processing. Despite extensive efforts made in recent years, the joint transceiver beamforming of frequency diverse array (FDA)-based multiple-input and ...
Langhuan Geng +4 more
doaj +1 more source
Medial Axis Aware Learning of Signed Distance Functions
Computer Graphics Forum, EarlyView.Abstract We propose a novel variational method to compute a highly accurate global signed distance function (SDF) to a given point cloud. To this end, the jump set of the gradient of the SDF, which coincides with the medial axis of the surface, is explicitly taken into account through a higher‐order variational formulation that enforces linear growth ...
Samuel Weidemaier +2 more
wiley +1 more source