Global and local convergence of a class of penalty-free-type methods for nonlinear programming
type: Item
instance of: scholarly article
title: Global and local convergence of a class of penalty-free-type methods for nonlinear programming
zbMATH Open document ID: 1252.90078
author: Songqiang Qiu
author: Zhongwen Chen
published in: Applied Mathematical Modelling
publication date: 2012-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6114172
zbMATH Keywords: nonlinear programming
zbMATH Keywords: penalty-free-type algorithm
zbMATH Keywords: feasibility safeguarding method
zbMATH Keywords: global convergence
zbMATH Keywords: local superlinear convergence
describes a project that uses: ipfilter
describes a project that uses: Ipopt
describes a project that uses: LANCELOT
describes a project that uses: CUTEr
describes a project that uses: CUTE
MaRDI profile type: Publication
full work available at URL: j.apm.2011.10.009
OpenAlex ID: W1974610717
cites work: Nonlinear programming without a penalty function.
cites work: On the Global Convergence of a Filter--SQP Algorithm
cites work: Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
cites work: On the superlinear local convergence of a filter-SQP method
cites work: On the global convergence of an SLP-filter algorithm that takes EQP steps
cites work: A globally convergent primal-dual interior-point filter method for nonlinear programming
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
cites work: Global and local convergence of a filter line search method for nonlinear programming
cites work: Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
cites work: Line Search Filter Methods for Nonlinear Programming: Local Convergence
cites work: Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
cites work: Nonlinear programming without a penalty function or a filter
cites work: A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization
cites work: A new penalty-free-type algorithm based on trust region techniques
cites work: A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
cites work: On combining feasibility, descent and superlinear convergence in inequality constrained optimization
cites work: Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
cites work: New Results on a Continuously Differentiable Exact Penalty Function
cites work: A computationally efficient feasible sequential quadratic programming algorithm
cites work: Q4840764
cites work: Quasi-Newton Methods, Motivation and Theory
cites work: Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
cites work: Numerical Optimization
cites work: CUTE
cites work: Q4151662
cites work: Q4288940
DOI: 10.1016/J.APM.2011.10.009
Recommended article: Global and local convergence of a penalty-free method for nonlinear programming
Recommended article: An exact penalty function method with global convergence properties for nonlinear programming problems
Recommended article: Global convergence of a class of smooth penalty methods for semi-infinite programming
Recommended article: Global convergence of a nonlinear programming method using convex approximations
Recommended article: On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
Recommended article: Q4836280
Recommended article: From global to local convergence of interior methods for nonlinear optimization
Recommended article: Global convergence and finite termination of a class of smooth penalty function algorithms
Recommended article: Q2993667
Recommended article: On the Local Convergence of a Penalty-Function-Free SQP Method
description: scientific article; zbMATH DE number 6114172