نتایج جستجو برای: sequential quadratic programming

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

Journal: :SIAM Journal on Optimization 1995
Walter Murray Francisco J. Prieto

Journal: :journal of advances in computer research 2013
rasoul rajaei ali akbar gharaveisi seyed mohammad ali mohammadi

this paper presents a fuzzy approach to the prediction of highly nonlinear timeseries.the optimized mamdani-type fuzzy system denoted sqp-flc is applied forthe input-output modeling of measured data. in order to tune fuzzy membershipfunctions, a sequential quadratic programming (sqp) method is employed. theproposed method is evaluated and validated on a highly complex time series, dailygold pri...

Journal: :Comp. Opt. and Appl. 1999
William W. Hager

Recently, Wright proposed a stabilized sequential quadratic programming algorithm for inequality constrained optimization. Assuming the Mangasarian-Fromovitz constraint qualification and the existence of a strictly positive multiplier (but possibly dependent constraint gradients), he proved a local quadratic convergence result. In this paper, we establish quadratic convergence in cases where bo...

2010
Paul T Boggs Jon W Tolle

Introduction Since its popularization in the late s Sequential Quadratic Program ming SQP has arguably become the most successful method for solving nonlinearly constrained optimization problems As with most optimization methods SQP is not a single algorithm but rather a conceptual method from which numerous speci c algorithms have evolved Backed by a solid theoretical and computational foundat...

2011
Philip E. GILL Elizabeth WONG

In his 1963 PhD thesis, Wilson proposed the first sequential quadratic programming (SQP) method for the solution of constrained nonlinear optimization problems. In the intervening 48 years, SQP methods have evolved into a powerful and effective class of methods for a wide range of optimization problems. We review some of the most prominent developments in SQP methods since 1963 and discuss the ...

We consider a fractional program with both linear and quadratic equation in numerator and denominator  having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a  second order cone programming (SOCP)  problem.  For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The p...

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

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