Convergence of a three-dimensional dwindling filter algorithm without feasibility restoration phase

DOI10.1080/01630563.2015.1133643zbMATH Open1338.90392OpenAlexW2289648817MaRDI QIDQ2805993FDOQ2805993

Authors: Chao Gu, Detong Zhu 

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

Recommendations

• A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization
• Global convergence of a tri-dimensional filter SQP algorithm based on the line search method
• A dwindling filter line search algorithm for nonlinear equality constrained optimization
• A dwindling filter trust region algorithm for nonlinear optimization
• Global Convergence of Filter Methods for Nonlinear Programming

zbMATH Keywords

global convergencefeasibility restoration phaseLagrangian functionmodified limited memory Broyden-Fletcher-Goldfarb-Shanno (BFGS) updatingthree-dimensional dwindling filter

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• Benchmarking optimization software with performance profiles.
• On the Global Convergence of a Filter--SQP Algorithm
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• Nonlinear programming without a penalty function.
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• A non-monotone line search multidimensional filter-SQP method for general nonlinear programming
• A trust region filter method for general non-linear programming
• A dwindling filter inexact projected Hessian algorithm for large scale nonlinear constrained optimization
• Line Search Filter Methods for Nonlinear Programming: Local Convergence
• A dwindling filter line search method for unconstrained optimization
• 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
• Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
• A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
• A secant algorithm with line search filter method for nonlinear optimization
• A Filter-Trust-Region Method for Unconstrained Optimization
• A superlinearly convergent numerical algorithm for nonlinear programming
• A modified SQP method with nonmonotone technique and its global convergence
• A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
• A derivative-free method for the system of nonlinear equations
• An efficient feasible SQP algorithm for inequality constrained optimization
• A modified limited SQP method for constrained optimization

Cited In (3)

• A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization
• A dwindling filter trust region algorithm for nonlinear optimization
• Some results on the filter method for nonlinear complementary problems

This page was built for publication: Convergence of a three-dimensional dwindling filter algorithm without feasibility restoration phase

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805993)