Results 61 to 70 of about 3,146 (222)
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
Reformulating mixed-integer quadratically constrained quadratic programs [PDF]
, 2011 It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a variety of optimisation problems. Moreover, in the particular case of mixed-integer quadratic programs, SDP has been used to reformulate problems, rather ...
Galli, L, Letchford, A. N.
core
Multi‐Strategy Synergy‐Based Differential Evolution for Large Wind Farm Layout Optimization
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Exploring clean energy alternatives to fossil fuels has become a major research focus worldwide. Wind energy is regarded as one of the most promising renewable energy sources due to its clean and sustainable nature. However, wake interactions among turbines significantly reduce power conversion efficiency, making wind farm layout optimization (
Haotian Li +5 more
wiley +1 more source
The Complexity of Optimizing over a Simplex, Hypercube or Sphere: A Short Survey [PDF]
We consider the computational complexity of optimizing various classes of continuous functions over a simplex, hypercube or sphere.These relatively simple optimization problems have many applications.We review known approximation results as well as ...
Klerk, E. de
core +4 more sources
The Reformulation-based aGO Algorithm for Solving Nonconvex MINLP Problems – Some Improvements
Chemical Engineering Transactions, 2013 The a-reformulation (aR) technique can be used to transform any nonconvex twice-differentiable mixed-integer nonlinear programming problem to a convex relaxed form.
A. Lundell, T. Westerlund
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
Hidden Convexity in Partially Separable Optimization [PDF]
The paper identifies classes of nonconvex optimization problems whose convex relaxations have optimal solutions which at the same time are global optimal solutions of the original nonconvex problems. Such a hidden convexity property was so far limited to
Laurent, M., Ben-Tal, A., Hertog, D. den
core +1 more source
Canonical Duality Theory and Solutions to Constrained Nonconvex Quadratic Programming [PDF]
, 2004 This paper presents a perfect duality theory and a complete set of solutions to nonconvex quadratic programming problems subjected to inequality constraints.
David Yang Gao
core
IEEE Access, 2019 Stringent physical resource constraints in unmanned aerial vehicle (UAV) communications bring new challenges to energy efficient transmission. In this paper, we study energy efficient beamforming for UAV communications, where a wideband hybrid polarized ...
Gui Zhou
doaj +1 more source
Assessing second‐price auctions for parcel exchanges in last‐mile logistics
International Transactions in Operational Research, EarlyView.Abstract The rapid growth of e‐commerce has led to multiple carriers operating in the same regions, creating opportunities for collaboration. However, logistics companies typically operate independently, leading to inefficiencies. Horizontal cooperation, where carriers share resources and infrastructure, can improve efficiency and reduce costs.
Christian Truden, Margaretha Gansterer
wiley +1 more source