Results 51 to 60 of about 1,124 (204)
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
On convergence of the maximum block improvement method [PDF]
, 2015 . The MBI (maximum block improvement) method is a greedy approach to solving optimization problems where the decision variables can be grouped into a finite number of blocks. Assuming that optimizing over one block of variables while fixing all others is
Shuzhong Zhang +5 more
core +2 more sources
A Quantised Push‐Sum Distributed Adaptive Momentum Algorithm for Optimisation Over Directed Networks
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT In this paper, we investigate a distributed constrained optimisation problem over directed networks. The agents in the networks conduct local computations and communications, endeavouring to collaboratively minimise the aggregation of all locally known convex cost functions subject to a global constraint set.
Qingguo Lü +6 more
wiley +1 more source
On the relationship between bilevel decomposition algorithms and direct interior-point methods [PDF]
, 2004 Engineers have been using bilevel decomposition algorithms to solve certain nonconvex large-scale optimization problems arising in engineering design projects.
Miguel, Angel Víctor de +3 more
core
A Global Optimization Algorithm for Generalized Quadratic Programming [PDF]
, 2020 We present a global optimization algorithm for solving generalized quadratic programming (GQP), that is, nonconvex quadratic programming with nonconvex quadratic constraints.
Hongwei Jiao, Yongqiang Chen
core
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
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
The bounds of feasible space on constrained nonconvex quadratic programming [PDF]
, 2008 This paper presents a method to estimate the bounds of the radius of the feasible space for a class of constrained nonconvex quadratic programmings. Results show that one may compute a bound of the radius of the feasible space by a linear programming ...
Zhu, Jinghao
core +1 more source
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Repetitive motion planning (RMP) for redundant manipulators with high convergent precision becomes an intense research topic due to its more degrees of freedom. In this paper, a specific zeroing neural dynamics (SZND) model for the RMP is first set up via zeroing neurodynamics.
Ying Kong +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