نتایج جستجو برای: الگوریتم sqp

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

Journal: :SIAM J. Discrete Math. 2008
Cláudia Linhares Sales Frédéric Maffray Bruce A. Reed

A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Hougardy conjectured that the minimal forbidden subgraphs for the class of SQP graphs are the odd chordless cycles, the complements of odd or even chordless cycles, and some line-graphs of bipartite graphs. Here we prove t...

2015
Mohammad SALEHI Majid SIAMPOUR Assunta BERTACCINI

Phytoplasmas associated with cucumber phyllody (CuP) and squash phyllody (SqP) in Yazd province of Iran were characterized by molecular analyses and biological studies. Orosius albicinctus leafhoppers testing positive for phytoplasma presence by polymerase chain reaction (PCR) successfully transmitted CuP and SqP phytoplasmas to healthy cucumber and squash plants. The phytoplasmas were also tra...

1995
Brian L. Evans Douglas R. Firth Kennard D. White Edward A. Lee

This paper gives an algebraic framework for designing analog lters that are jointly optimized for magnitude, phase, and step responses, and lter quality. We formulate the design problem as a sequential quadratic programming (SQP) problem and use symbolic mathematical software to translate the SQP formulation into workingMATLAB programs to optimize analog lters.

2015
A. F. Izmailov M. V. Solodov

We consider sequential quadratic programming methods (SQP) globalized by linesearch for the standard exact penalty function. It is well known that if the Hessian of the Lagrangian is used in SQP subproblems, the obtained direction may not be of descent for the penalty function. The reason is that the Hessian need not be positive definite, even locally, under any natural assumptions. Thus, if a ...

2002
Luis Morales Jorge Nocedal Richard A. Waltz Guanghui Liu Jean-Pierre Goux

z Abstract. A series of numerical experiments with interior point (LOQO, KNI-TRO) and active-set SQP codes (SNOPT, lterSQP) are reported and analyzed. The tests were performed with small, medium-size and moderately large problems, and are examined by problem classes. Detailed observations on the performance of the codes, and several suggestions on how to improve them are presented. Overall, int...

2015
P. Paramasivan R. K. Santhi M. Basu Yong Zhang Dun-wei Gong Xiao-yan Sun Xiaohua Xia Xingwen jiang jianzhong zhou Hao wang

1. M.Basu, “Dynamic economic emission dispatch using non-dominated sorting genetic algorithm-II,” Electrical power and Energy systems 30 (2008) 140-149. 2. Li xuebin , “Study of multi-objective optimization and multi-attribute decision-making for dynamic economic emission dispatch,” Electric power components and systems, vol. 37: pp 1133-1148, 2009. 3. Elaiw A.M., Xia X,.Shehata A.M, “ Hydrid D...

Journal: :Graphs and Combinatorics 2001
Cláudia Linhares Sales Frédéric Maffray Bruce A. Reed

A graph is a strict-quasi parity (SQP) graph if every induced subgraph that is not a clique contains a pair of vertices with no odd chordless path between them (an``even pair''). We present an O…n 3 † algorithm for recognizing planar strict quasi-parity graphs, based on Wen-Lian Hsu's decomposition of planar (perfect) graphs and on the (non-algorithmic) characterization of planar minimal non-SQ...

Journal: :SIAM Journal on Optimization 1998
Craig T. Lawrence

A sequential quadratic programming (SQP) algorithm generating feasible iterates is described and analyzed. What distinguishes this algorithm from previous feasible SQP algorithms proposed by various authors is a reduction in the amount of computation required to generate a new iterate while the proposed scheme still enjoys the same global and fast local convergence properties. A preliminary imp...

ژورنال: فرآیند نو 2017

در این تحقیق ‌برای روشن شدن تاثیر متغیرهای ورودی مهم فرآیندی که شامل دمای راکتور، ‌دمای قسمت بالای برج جداساز، ‌شدت جریان خوراک و دمای پایین برج بوتان زدا بودند بر متغیرهای خروجی مقدار بنزین تولیدی،‌گاز مایع،‌عدد اکتان و درصد تبدیل محصولات از شبکه عصبی و مدلهای آماری استفاده شد . با توجه به کارآیی هریک از این دوروش، شبکه عصبی به عنوان مدل مناسب انتخاب شده و مقدار خطای آن کمینه شد. براساس مدل ان...

Journal: :SIAM Journal on Optimization 2002
Matthias Heinkenschloss Luís N. Vicente

In this paper we study the global convergence behavior of a class of composite–step trust–region SQP methods that allow inexact problem information. The inexact problem information can result from iterative linear systems solves within the trust–region SQP method or from approximations of first–order derivatives. Accuracy requirements in our trust– region SQP methods are adjusted based on feasi...

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

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