Global Convergence of Filter Methods for Nonlinear Programming
From MaRDI portal
Publication:3395013
DOI10.1137/060672285zbMATH Open1169.49034OpenAlexW2051240370MaRDI QIDQ3395013FDOQ3395013
Authors: Elizabeth W. Karas, Ademir Alves Ribeiro, C. C. Gonzaga 
Publication date: 20 August 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060672285
Recommendations
- A Globally Convergent Filter Method for Nonlinear Programming
- Global convergence of a general filter algorithm based on an efficiency condition of the step
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Global and local convergence of a filter line search method for nonlinear programming
- Global convergence of slanting filter methods for nonlinear programming
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cited In (35)
- Global convergence of slanting filter methods for nonlinear programming
- A filter algorithm: comparison with NLP solvers
- An augmented Lagrangian filter method
- Sequential quadratic programming with a flexible step acceptance strategy
- Local convergence of a trust-region algorithm with line search filter technique for nonlinear constrained optimization
- A filter inexact-restoration method for nonlinear programming
- A trust-region approach with novel filter adaptive radius for system of nonlinear equations
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- Global and local convergence of a filter line search method for nonlinear programming
- Local convergence of filter methods for equality constrained non-linear programming
- A dwindling filter line search method for unconstrained optimization
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Filter-based DIRECT method for constrained global optimization
- A tri-dimensional filter SQP algorithm for variational inequality problems
- A Globally Convergent Filter Method for Nonlinear Programming
- Global convergence of a general filter algorithm based on an efficiency condition of the step
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- A nonmonotone filter method for nonlinear optimization
- A filter-based artificial fish swarm algorithm for constrained global optimization: theoretical and practical issues
- Optimal non-anticipative scenarios for nonlinear hydro-thermal power systems
- A filter algorithm with inexact line search
- A feasible filter SQP algorithm with global and local convergence
- The Statistical Filter Approach to Constrained Optimization
- A filter method with unified step computation for nonlinear optimization
- A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- Convergence of a three-dimensional dwindling filter algorithm without feasibility restoration phase
- Filter-based stochastic algorithm for global optimization
- A nonmonotone filter SQP method: local convergence and numerical results
- Dynamic filters and randomized drivers for the multi-start global optimization algorithm MSNLP
- Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming
- A restoration-free filter SQP algorithm for equality constrained optimization
- An inexact restoration derivative-free filter method for nonlinear programming
- Global convergence of a non-monotone trust-region filter algorithm for nonlinear programming
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
Uses Software
This page was built for publication: Global Convergence of Filter Methods for Nonlinear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395013)
