A method without a penalty function or a filter for nonlinear constrained optimization

MaRDI QIDQ5196642zbMATH OpenFDO

Authors Shuangyong Zuo, Xiangling Wang, Zhibin Zhu

Publication date 2 October 2019

zbMATH Keywords

global convergenceline searchnonlinear constrained optimizationgeneralized projection methodstrongly sub-feasible direction method

Mathematics Subject Classification ID

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

Recommendations

• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
• Nonlinear programming without a penalty function or a filter
• A QP-free infeasible method without a penalty function and a filter
• A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
• An SQP-filter method without restoration process

Cited in

(5)

• Solving constrained global optimization problems without penalty parameters
• An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
• A filter-genetic algorithm for constrained optimization problems
• A filter method with unified step computation for nonlinear optimization
• A penalty derivative-free algorithm for nonlinear constrained optimization

This page was built for publication: A method without a penalty function or a filter for nonlinear constrained optimization

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