Chemical engineering applications have been a source of challenging optimization
problems for over 50 years. For many chemical process systems, detailed steady state and …

Line search methods are proposed for nonlinear programming using Fletcher and Leyffer's
filter method [Math. Program., 91 (2002), pp. 239--269], which replaces the traditional merit …

Abstract In his 1963 PhD thesis, Wilson proposed the first sequential quadratic programming
(SQP) method for the solution of constrained nonlinear optimization problems. In the …

Recent developments in numerical methods for solving large differentiable nonlinear
optimization problems are reviewed. State-of-the-art algorithms for solving unconstrained …

We consider the question of global convergence of iterative methods for nonlinear
programming problems. Traditionally, penalty functions have been used to enforce global …

Inspired by penalty-free approaches for smooth optimization problems, we propose a
sequential linearized proximal gradient method (SLPG) for a class of optimization problems …

To achieve welding torch trajectory continuous smooth and welding time the shortest, which
of the underwater visual welding robot end, a method of interpolation the location-time …

Adaptive trust-region methods attempt to maintain strong convergence guarantees without
depending on conservative estimates of problem properties such as Lipschitz constants …

We present a general filter algorithm that allows a great deal of freedom in the step
computation. Each iteration of the algorithm consists basically in computing a point which is …

We propose a new nonmonotone filter method to promote global and fast local convergence
for sequential quadratic programming algorithms. Our method uses two filters: a standard …