Global and local convergence of a penalty-free method for nonlinear programming

DOI10.1016/j.camwa.2012.10.012zbMath1319.90064OpenAlexW2005400096MaRDI QIDQ493442

Zhongwen Chen, Songqiang Qiu

Publication date: 3 September 2015

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2012.10.012

zbMATH Keywords

global convergencenonlinear programminglocal convergencepenalty-free algorithmfeasibility safeguard method

Mathematics Subject Classification ID

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

Related Items (3)

A line search penalty-free method for nonlinear second-order cone programming ⋮ A line search exact penalty method with bi-object strategy for nonlinear constrained optimization ⋮ On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming

This page was built for publication: Global and local convergence of a penalty-free method for nonlinear programming