Results 41 to 50 of about 8,709 (260)

Synthesis of Transmitarrays via Convex Relaxation

open access: yes2020 IEEE International Symposium on Antennas and Propagation and North American Radio Science Meeting, 2020
A mathematical approach for the phase-only synthesis of transmitarray antennas based on iterative convex optimization is presented. Using semidefinite relaxation techniques, the proposed framework is suitable for a wide range of beam shaping applications.
Foglia Manzillo, Francesco   +4 more
openaire   +2 more sources

Extended sufficient conditions for exact relaxation of the complementarity constraints in storage-concerned economic dispatch

open access: yesCSEE Journal of Power and Energy Systems, 2018
Storage is widely considered in economic dispatch (ED) problems. To prevent simultaneous charging and discharging of a storage device, a storage-concerned ED problem should involve complementarity constraints for every storage device to make the problem ...
Zhengshuo Li   +3 more
doaj   +1 more source

Efficient Sensor Node Selection for Observability Gramian Optimization

open access: yesSensors, 2023
Optimization approaches that determine sensitive sensor nodes in a large-scale, linear time-invariant, and discrete-time dynamical system are examined under the assumption of independent and identically distributed measurement noise.
Keigo Yamada   +5 more
doaj   +1 more source

A Convex Relaxation for Multi-Graph Matching [PDF]

open access: yes2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2019
We present a convex relaxation for the multi-graph matching problem. Our formulation allows for partial pairwise matchings, guarantees cycle consistency, and our objective incorporates both linear and quadratic costs. Moreover, we also present an extension to higher-order costs.
Paul Swoboda   +4 more
openaire   +2 more sources

Distributed Optimal Control of DC Network Using Convex Relaxation Techniques

open access: yesEnergies
This paper proposes a novel distributed control strategy for DC microgrids using a convex relaxation method to ensure the system operates at the optimal power flow solution.
Yongbo Fu   +9 more
doaj   +1 more source

A convex OPF approximation for selecting the best candidate nodes for optimal location of power sources on DC resistive networks

open access: yesEngineering Science and Technology, an International Journal, 2020
This paper proposes a convex approximation approach for solving the optimal power flow (OPF) problem in direct current (DC) networks with constant power loads by using a sequential quadratic programming approach.
Oscar Danilo Montoya
doaj   +1 more source

Convexification of Hybrid AC-DC Optimal Power Flow with Line-Commutated Converters

open access: yesCSEE Journal of Power and Energy Systems
Line-commutated converter (LCC)-based high-voltage DC (HVDC) systems have been integrated with bulk AC power grids for interregional transmission of renewable power.
Hongyuan Liang   +3 more
doaj   +1 more source

Time‐Dependent Oxidation and Scale Evolution of a Wrought Co/Ni‐Based Superalloy

open access: yesAdvanced Engineering Materials, EarlyView.
This study shows how a new wrought Co/Ni‐based superalloy resists oxidation at 800 ∘$^\circ$C. The oxide scale changes from rough, fast‐growing spinel to a dense, protective chromia–alumina layer. Atom probe analysis reveals tiny refractory‐rich bubbles at the interface that mark the transition to long‐term, diffusion‐controlled protection ...
Cameron Crabb   +6 more
wiley   +1 more source

Convex underestimating relaxation techniques for nonconvex polynomial programming problems: computational overview

open access: yesJournal of the Mechanical Behavior of Materials, 2015
This paper introduces constructing convex-relaxed programs for nonconvex optimization problems. Branch-and-bound algorithms are convex-relaxation-based techniques.
Keller André A.
doaj   +1 more source

Estimations of Covering Functionals of Convex Bodies Based on Relaxation Algorithm

open access: yesMathematics, 2023
Estimating covering functionals of convex bodies is an important part of Chuanming Zong’s program to attack Hadwiger’s covering conjecture, which is a long-standing open problem from convex and discrete geometry.
Man Yu   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy