A Globally Convergent Filter Method for Nonlinear Programming
From MaRDI portal
Publication:4651962
DOI10.1137/S1052623401399320zbMath1079.90129MaRDI QIDQ4651962
Clóvis C. Gonzaga, Elizabeth W. Karas, Márcia Vanti
Publication date: 23 February 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
49M37: Numerical methods based on nonlinear programming
Related Items
On second-order optimality conditions for nonlinear programming, A filter-trust-region method for simple-bound constrained optimization, A filter algorithm: comparison with NLP solvers, A filter-line-search method for unconstrained optimization, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, Local convergence of an inexact-restoration method and numerical experiments, Global convergence of slanting filter methods for nonlinear programming, Generalization: One technique of computational and applied mathematical methodology, A bundle-filter method for nonsmooth convex constrained optimization, A new line search inexact restoration approach for nonlinear programming, Global convergence of a tri-dimensional filter SQP algorithm based on the line search method, Gauss-Newton-based BFGS method with filter for unconstrained minimization, A filter inexact-restoration method for nonlinear programming, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems, Local convergence of filter methods for equality constrained non-linear programming, A nonmonotone SQP-filter method for equality constrained optimization, A filter-trust-region method for LC 1 unconstrained optimization and its global convergence, Global convergence of a filter-trust-region algorithm for solving nonsmooth equations, The Sequential Quadratic Programming Method
