— As there are many good optimization algorithms each with its own characteristics, it is very difficult to choose the best method for optimization problems. Thus, it is importa...
We present a class of inexact adaptive multilevel trust-region SQP-methods for the efficient solution of optimization problems governed by nonlinear partial differential equations...
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
Stephanus Daniel Handoko, Chee Keong Kwoh, Yew-Soo...
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...