
The author presents and studies an active set sequential quadratic programming (SQP) algorithm for inequality constrained optimization problems of the form \[ \min f(x)\quad\text{s.t. }c(x)\geq 0, \] where \(f(x)\) and \(c(x)\) are twice continuously differentiable functions. The given results show that the global convergence of the SQP algorithm is still guaranteed by deleting some redundant constraints. No numerical tests are given.
Applied Mathematics, Sequential quadratic programming, active set method, 510, Methods of successive quadratic programming type, global convergence, Computational Mathematics, Numerical mathematical programming methods, Nonlinear programming, Nonlinearly constrained optimization, Active set
Applied Mathematics, Sequential quadratic programming, active set method, 510, Methods of successive quadratic programming type, global convergence, Computational Mathematics, Numerical mathematical programming methods, Nonlinear programming, Nonlinearly constrained optimization, Active set
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
