Constrained Nonlinear Control Allocation With Singularity Avoidance Using Sequential Quadratic Programming
نویسندگان
چکیده
منابع مشابه
P , Sequential Quadratic Constrained Quadratic Programming
We follow the popular approach for unconstrained minimization, i.e. we develop a local quadratic model at a current approximate minimizer in conjunction with a trust region. We then minimize this local model in order to nd the next approximate minimizer. Asymptot-ically, nding the local minimizer of the quadratic model is equivalent to applying Newton's method to the stationarity condition. For...
متن کاملNonlinear Model Predictive Control via Feasibility-Perturbed Sequential Quadratic Programming
Model predictive control requires the solution of a sequence of continuous optimization problems that are nonlinear if a nonlinear model is used for the plant. We describe briefly a trust-region feasibility-perturbed sequential quadratic programming algorithm (developed in a companion report), then discuss its adaptation to the problems arising in nonlinear model predictive control. Computation...
متن کاملA Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
We present an algorithm that achieves superlinear convergence for nonlinear programs satisfying the Mangasarian-Fromovitz constraint qualiication and the quadratic growth condition. This convergence result is obtained despite the potential lack of a locally convex augmented Lagrangian. The algorithm solves a succession of subproblems that have quadratic objective and quadratic constraints, both...
متن کاملSequential Quadratic Programming forLarge - Scale Nonlinear Optimization ?
The sequential quadratic programming (SQP) algorithm has been one of the most successful general methods for solving nonlinear constrained optimization problems. We provide an introduction to the general method and show its relationship to recent developments in interior-point approaches. We emphasize large-scale aspects.
متن کاملSequential equality-constrained optimization for nonlinear programming
A new method is proposed for solving optimization problems with equality constraints and bounds on the variables. In the spirit of Sequential Quadratic Programming and Sequential Linearly-Constrained Programming, the new method approximately solves, at each iteration, an equality-constrained optimization problem. The bound constraints are handled in outer iterations by means of an Augmented Lag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control Systems Technology
سال: 2004
ISSN: 1063-6536
DOI: 10.1109/tcst.2003.821952