نتایج جستجو برای: p power convexification method

تعداد نتایج: 3129501  

2008
Peter Elbau Markus Grasmair Frank Lenzen Otmar Scherzer

We establish a semi-group solution concept for morphological differential equations, such as the mean curvature flow equation. The proposed method consists in generating flows from generalized minimizers of nonconvex energy functionals. We use relaxation and convexification to define generalized minimizers. The main part of this work consists in verification of the solution concept by comparing...

Journal: :international journal of smart electrical engineering 0
mostafa alizadeh soltani islamic azad university centeral tehran branch, iran

in the most described maximum power point tracking (mppt) methods in the literatures, the optimal operation point of the photovoltaic (pv) systems is estimated by linear approximations. however, these approximations can lead to less optimal operating conditions and significantly reduce the performances of the pv systems. this paper proposes a new approach to determine the maximum power point (m...

2004
Stefan Röttger Stefan Guthe Andreas Schieber Thomas Ertl

Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For concave or cyclic meshes, however, a significant overhead is required to sort the grid cells in back to front order. In this paper we apply methods known from computational geometry to transform concave into convex grids. W...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه لرستان - دانشکده علوم پایه 1389

abstract part one: the electrode oxidation potentials of a series of eighteen n-hydroxy compounds in aqueous solution were calculated based on a proper thermodynamic cycle. the dft method at the level of b3lyp-6-31g(d,p) was used to calculate the gas-phase free energy differences ,and the polarizable continuum model (pcm) was applied to describe the solvent and its interaction with n-hydroxy ...

2008
V. GABREL

We address here a class of particularly hard-to-solve combinatorial optimization problems namely multicommodity network optimization when the link cost functions are discontinuous step increasing. The main focus is on the development of relaxations for such problems in order to derive lower bounds. A straightforward way of getting lower bounds is to solve the “convexification” of the problem, i...

Journal: :Automatica 2011
Behçet Açikmese Lars Blackmore

We consider a class of finite time horizon optimal control problems for continuous time linear systems with a convex cost, convex state constraints and non-convex control constraints. We propose a convex relaxation of the non-convex control constraints, and prove that the optimal solution of the relaxed problem is also an optimal solution for the original problem, which is referred to as the lo...

Journal: :IEEE Transactions on Communications 2023

To exploit the potential of reconfigurable intelligent surface (RIS) in supporting integrated sensing and communication (ISAC), this paper proposes a novel joint active passive beamforming design for RIS-enabled ISAC system consideration target size. First, detection probability is derived closed-form based on illumination power an approximated scattering area target, new concept ultimate resol...

Journal: :Studies in Informatics and Control 2013

2009
Christian Kirches Hans Georg Bock Johannes P. Schlöder Sebastian Sager

In this contribution we address the efficient solution of optimal control problems of dynamic processes with many controls. Such problems typically arise from the convexification of integer control decisions. We treat this problem class using the direct multiple shooting method to discretize the optimal control problem. The resulting nonlinear problems are solved using an SQP method. Concerning...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید