Results 11 to 20 of about 724 (154)
Optimal Power Flow Solution for Bipolar DC Networks Using a Recursive Quadratic Approximation
Energies, 2023 The problem regarding of optimal power flow in bipolar DC networks is addressed in this paper from the recursive programming stand of view. A hyperbolic relationship between constant power terminals and voltage profiles is used to resolve the optimal ...
Oscar Danilo Montoya +2 more
doaj +1 more source
On the role of demagnetizing tensors in arbitrary orientations of general ellipsoids and implications for MRI safety assessment. [PDF]
Med PhysAbstract Background Demagnetizing tensors describe the shape anisotropic contribution of magnetic susceptibility, that is, how an object's shape and orientation affect its internal magnetization. Ellipsoids possess a unique geometric property by exhibiting homogeneous internal magnetization, enabling a purely geometrical characterization.
Pakarinen T.
europepmc +2 more sources
A Mixed-Integer Quadratic Formulation of the Phase-Balancing Problem in Residential Microgrids
Applied Sciences, 2021 Phase balancing is a classical optimization problem in power distribution grids that involve phase swapping of the loads and generators to reduce power loss. The problem is a non-linear integer and, hence, it is usually solved using heuristic algorithms.
Alejandro Garces +4 more
doaj +1 more source
Mean Squared Variance Portfolio: A Mixed-Integer Linear Programming Formulation
Mathematics, 2021 The mean-variance (MV) portfolio is typically formulated as a quadratic programming (QP) problem that linearly combines the conflicting objectives of minimizing the risk and maximizing the expected return through a risk aversion profile parameter.
Francisco Fernández-Navarro +3 more
doaj +1 more source
Interior-point algorithms for a class of convex optimization problems [PDF]
Yugoslav Journal of Operations Research, 2009 In this paper we consider interior-point methods (IPM) for the nonlinear, convex optimization problem where the objective function is a weighted sum of reciprocals of variables subject to linear constraints (SOR).
Lešaja Goran, Slaughter Verlynda N.
doaj +1 more source
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
Robust solutions to box-constrained stochastic linear variational inequality problem
Journal of Inequalities and Applications, 2017 We present a new method for solving the box-constrained stochastic linear variational inequality problem with three special types of uncertainty sets.
Mei-Ju Luo, Yan Zhang
doaj +1 more source
Journal 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
IEEE AccessThis paper aims to explore reconfigurable intelligent surface (RIS) integration in a millimeter wave (mmWave) communication system with low-complexity transceiver architecture under imperfect channel state information (CSI) assumption. Motivated by this,
Kali Krishna Kota, Praful D. Mankar
doaj +1 more source
Parallel Vectors Extraction using Bézier Clipping
Computer Graphics Forum, EarlyView.Abstract In this paper, we propose a novel local feature extraction algorithm for the parallel vectors (PV) operator. Our method is based on Bézier clipping, which is a bracketing‐based root finding method that is commonly‐used in computer‐aided geometric design.
Nico Daßler, Tobias Günther
wiley +1 more source