نتایج جستجو برای: inequality constraint

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

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...

2005
Ayman Elnashar Said Elnoubi

A robust block adaptive blind multiuser receiver based on block-Shanno constant modulus algorithm (BSCMA) with a Quadratic Inequality (QI) constraint on the weight vector norm is developed in this paper. Quadratic constraint has been a widespread methodology to improve the robustness of least-mean square detectors. The BSCMA is realized using a modified Newton’s algorithm without inverse of Hes...

2016
Ye Wang Andres Ramirez-Jaime Feng Xu Vicenç Puig

This paper presents a nonlinear model predictive control (NMPC) strategy combined with constraint satisfactions for a quadcopter. The full dynamics of the quadcopter describing the attitude and position are nonlinear, which are quite sensitive to changes of inputs and disturbances. By means of constraint satisfactions, partial nonlinearities and modeling errors of the control-oriented model of ...

2007
Henrik Reif Andersen Tarik Hadzic John N. Hooker Peter Tiedemann

The typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-width multivalued decision diagram (MDD). It reduces to a traditional domain store when the maximum width is one but allows greater pruning of the search tree for larger widths. MDD propagation algorithms can be develo...

Journal: :TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series A 1991

2000
Hiroshi Hosobe

This paper proposes an algorithm for satisfying systems of linear equality and inequality constraints with hierarchical strengths or preferences. Basically, it is a numerical method that incrementally obtains the LU decompositions of linear constraint systems. To realize this, it introduces a novel technique for analyzing hierarchical systems of linear constraints. In addition, it improves perf...

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

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