Convergence of a Three-Dimensional Dwindling Filter Algorithm Without Feasibility Restoration Phase
From MaRDI portal
Publication:2805993
DOI10.1080/01630563.2015.1133643zbMath1338.90392OpenAlexW2289648817MaRDI QIDQ2805993
Publication date: 13 May 2016
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2015.1133643
global convergenceLagrangian functionfeasibility restoration phasemodified limited memory Broyden-Fletcher-Goldfarb-Shanno (BFGS) updatingthree-dimensional dwindling filter
Related Items (1)
Cites Work
- A dwindling filter inexact projected Hessian algorithm for large scale nonlinear constrained optimization
- A secant algorithm with line search filter method for nonlinear optimization
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
- An efficient feasible SQP algorithm for inequality constrained optimization
- A derivative-free method for the system of nonlinear equations
- Sequential penalty quadratic programming filter methods for nonlinear programming
- A globally and superlinearly convergent modified SQP-filter method
- Global convergence of a tri-dimensional filter SQP algorithm based on the line search method
- A modified SQP method with nonmonotone technique and its global convergence
- A superlinearly convergent numerical algorithm for nonlinear programming
- A non-monotone line search multidimensional filter-SQP method for general nonlinear programming
- A trust region filter method for general non-linear programming
- A Modified Limited SQP Method For Constrained Optimization
- 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
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- A Filter-Trust-Region Method for Unconstrained Optimization
- A dwindling filter line search method for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- Nonlinear programming without a penalty function.
This page was built for publication: Convergence of a Three-Dimensional Dwindling Filter Algorithm Without Feasibility Restoration Phase