نتایج جستجو برای: convex optimization

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

Journal: :Foundations and Trends® in Machine Learning 2015

Journal: :Journal of Physics: Conference Series 2021

Journal: :Electronic Journal of Statistics 2015

Journal: :Mathematical Inequalities & Applications 1998

Journal: :international journal of smart electrical engineering 2015
naser ghorbani babak adham payam farhadi

in this paper particle swarm optimization with smart inertia factor (pso-sif) algorithm is proposed to solve combined heat and power economic dispatch (chped) problem. the chped problem is one of the most important problems in power systems and is a challenging non-convex and non-linear optimization problem. the aim of solving chped problem is to determine optimal heat and power of generating u...

Journal: :iranian journal of mathematical sciences and informatics 0
m. r. peyghami faculty of matematics s. fathi hafshejani faculty of matematics

in this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual interior point method (ipm) based on a new kernel function with a trigonometric barrier term. iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. although our proposed kernel function is neither a self-regular (sr) function nor logarithmic barrier ...

2005
Mónica Hernández René Meziat

We propose an alternative method for computing e¤ectively the solution of the control inventory problem under non-convex polynomial cost functions. We apply the method of moments in global optimization to transform the corresponding, non-convex dynamic programming problem into an equivalent optimal control problem with linear and convex structure. We device computational tools based on convex o...

2014
André A. Keller

This paper introduces to constructing problems of convex relaxations for nonconvex polynomial optimization problems. Branch-and-bound algorithms are convex relaxation based. The convex envelopes are of primary importance since they represent the uniformly best convex underestimators for nonconvex polynomials over some region. The reformulationlinearization technique (RLT) generates LP (linear p...

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

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