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

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

2005
Hao Jiang Ze-Nian Li Mark S. Drew

We present a novel human body gesture recognition method using a linear programming based matching scheme. Instead of attempting to segment an object from the background, we develop a novel successive convexification linear programming method to locate the target by searching for the best matching region based on a graph template. The linear programming based matching scheme generates relativel...

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

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

Journal: :Journal of Guidance Control and Dynamics 2022

No AccessEngineering NotesMars Entry Trajectory Planning with Range Discretization and Successive ConvexificationXu Liu, Shuang Li Ming XinXu LiuNanjing University of Aeronautics Astronautics, 211106 Nanjing, People’s Republic China*Ph.D. Candidate, Department Aerospace Control Engineering; .Search for more papers by this author, https://orcid.org/0000-0001-9142-5036Nanjing China†Professor, (Co...

2016
James Ting-Ho Lo Yichuan Gui Yun Peng

This paper presents a new method of training neural networks including deep learning machines, which is based on the idea of convexifying the training error criterion by the use of the risk-averting error (RAE) criterion. Convexification creates tunnels between the depressed regions around saddle points, tilts the plateaus, and eliminates nonglobal local minima. The difficulties in computing th...

2017
Matthieu Fradelizi Mokshay Madiman Arnaud Marsiglietti Artem Zvavitch

Let us define for a compact set A ⊂ R the sequence A(k) = { a1 + · · ·+ ak k : a1, . . . , ak ∈ A } = 1 k ( A+ · · ·+A } {{ } k times ) . It was independently proved by Shapley, Folkman and Starr (1969) and by Emerson and Greenleaf (1969) that A(k) approaches the convex hull of A in the Hausdorff distance induced by the Euclidean norm as k goes to ∞. We explore in this survey how exactly A(k) a...

Journal: :Discrete Mathematics 2010
Adrian Dumitrescu Evan Hilscher

Given a polygon P in the plane, a pop operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, and show that any polygon from this family cannot be convexified by pop operations. This family contains simple, as well as non-simple (i.e., self-intersecting) polygons, as desired. We thereby answer in the negative an...

Journal: :Mathematics 2021

In this paper, an adaptive proximal bundle method is proposed for a class of nonconvex and nonsmooth composite problems with inexact information. The are the sum finite convex function information function. For function, we design convexification technique ensure linearization errors its augment to be nonnegative. Then, regarded as approximate primal problem. adopt disaggregate strategy regard ...

Journal: :iranian biomedical journal 0
rakesh kumar sinha amit kumar ray

continuous four hours eeg (electroencephalogram) recordings and its power spectrum analysis using fast fourier transform (fft) in urethane anesthetized male charles foster rats were performed in two groups: open brain injury and p-cpa (para-chlorophenylalanine) pretreated before brain injury, respectively, and compared with the eeg power spectrum of control rats. the eeg power spectrum analysis...

2010
Kwanghun Chung Youngkwan Chung Jean-Philippe P. Richard

of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy STRONG VALID INEQUALITIES FOR MIXED-INTEGER NONLINEAR PROGRAMS VIA DISJUNCTIVE PROGRAMMING AND LIFTING By Kwanghun Chung August 2010 Chair: Jean-Philippe. P. Richard Major: Industrial and Systems Engineering Mixed-Integer Nonlinear Progr...

Journal: :مهندسی سازه 0
علی کاوه مسعود پوربابا

in this paper by using concepts of graph theory, forces method and substructure ing method for analysis of structures, some methods have been introduced for optimal analysis of structures in a large scale, using substructuring method. planar rigid frames assuming linear behavior and small deformations, have been optimal analyzed, by using forces method. thus, a fortran power station computation...

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

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