Results 51 to 60 of about 7,641,552 (201)
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 +1 more
core +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
High Voltage, EarlyView.ABSTRACT Electric power systems are undergoing a fundamental transition from synchronous generator (SG)‐dominated systems to inverter‐based resource (IBR)‐dominated systems. Lyapunov‐ and energy‐function‐based direct methods provide an effective way to estimate the stability region, also known as the region of attraction (ROA), and have become a ...
Yifan Zhang +5 more
wiley +1 more source
Canonical duality for solving general nonconvex constrained problems [PDF]
, 2016 This paper presents a canonical duality theory for solving a general nonconvex constrained optimization problem within a unified framework to cover Lagrange multiplier method and KKT theory.
Latorre, V. +2 more
core +1 more source
IET Smart Energy Systems, EarlyView.A hybrid GA–PSO framework determines the optimal placement and sizing of distributed battery energy storage systems in a PV‐enriched low voltage feeder, whereas dynamic consensus control (DCC) coordinates their operation. The integrated approach mitigates voltage rise and reverse power flow and promotes balanced utilisation of multiple storage units ...
Nirakar Nepal +4 more
wiley +1 more source
Branch-and-Sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part I: Theoretical development [PDF]
, 2013 We present a global optimization algorithm, Branch-and-Sandwich, for optimistic bilevel programming problems that satisfy a regularity condition in the inner problem.
Kleniati, Polyxeni-Margarita +3 more
core +1 more source
Iterative phase retrieval in macromolecular crystal diffraction using the gradients of intensities
Journal of Applied Crystallography, EarlyView.Incorporating molecular intensity gradients into an iterative projection algorithm enables model‐free electron‐density reconstruction even for low‐solvent macromolecular crystals.Iterative phase retrieval (IPR) offers a model‐independent route to crystallographic structure determination but is fundamentally limited by the sampling of the diffraction ...
Sebastian Bielfeldt +3 more
wiley +1 more source
A Global Optimization Algorithm for Generalized Quadratic Programming
, 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
Applied System InnovationThe planning of unbalanced three-phase distribution networks increasingly requires the coordinated integration of distributed energy resources, such as photovoltaic (PV) generators and static compensators (D-STATCOMs), to enhance system performance and ...
Brandon Cortés-Caicedo +4 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