Global convergence of slanting filter methods for nonlinear programming

DOI10.1016/j.amc.2007.11.043zbMath1149.65042OpenAlexW2047986527MaRDI QIDQ932546

Elizabeth W. Karas, Ademir Alves Ribeiro, Ana Paula Oening

Publication date: 11 July 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.11.043

zbMATH Keywords

global convergencenonlinear programmingfilter methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (9)

Projected affine-scaling interior-point Newton's method with line search filter for box constrained optimization ⋮ Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems ⋮ A tri-dimensional filter SQP algorithm for variational inequality problems ⋮ Global convergence of a nonmonotone filter method for equality constrained optimization ⋮ Global convergence of a general filter algorithm based on an efficiency condition of the step ⋮ A new line search inexact restoration approach for nonlinear programming ⋮ Local convergence of filter methods for equality constrained non-linear programming ⋮ Gauss-Newton-based BFGS method with filter for unconstrained minimization ⋮ Filter-based stochastic algorithm for global optimization

Cites Work

• Unnamed Item
• Unnamed Item
• An interior-point algorithm for nonconvex nonlinear programming
• On the global convergence of an SLP-filter algorithm that takes EQP steps
• Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.
• Inexact-restoration algorithm for constrained optimization
• Numerical Optimization
• A Globally Convergent Filter Method for Nonlinear Programming
• On the Global Convergence of a Filter--SQP Algorithm
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• A trust region method based on interior point techniques for nonlinear programming.
• Nonlinear programming without a penalty function.
• Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.

This page was built for publication: Global convergence of slanting filter methods for nonlinear programming