Local convergence of filter methods for equality constrained non-linear programming
From MaRDI portal
Publication:3066927
DOI10.1080/02331930903085342zbMath1221.49058OpenAlexW2032410276MaRDI QIDQ3066927
Elizabeth W. Karas, Clóvis C. Gonzaga, Ademir Alves Ribeiro
Publication date: 20 January 2011
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930903085342
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
Sequential equality-constrained optimization for nonlinear programming, A filter-based artificial fish swarm algorithm for constrained global optimization: theoretical and practical issues, Assessing the reliability of general-purpose inexact restoration methods, Inexact Restoration approach for minimization with inexact evaluation of the objective function, A flexible inexact-restoration method for constrained optimization
Uses Software
Cites Work
- Local convergence of an inexact-restoration method and numerical experiments
- Global convergence of slanting filter methods for nonlinear programming
- A bundle-filter method for nonsmooth convex constrained optimization
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- Inexact-restoration algorithm for constrained optimization
- Convergence Properties of Algorithms for Nonlinear Optimization
- Global Convergence of Filter Methods for Nonlinear Programming
- Numerical Optimization
- A Globally Convergent Filter Method for Nonlinear Programming
- A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- Nonlinear programming without a penalty function.
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.