Global and local convergence of a class of penalty-free-type methods for nonlinear programming

DOI10.1016/J.APM.2011.10.009MaRDI QIDQ693410zbMATH OpenOpenAlexFDO

Authors Songqiang Qiu, Zhongwen Chen

Publication date 7 December 2012

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2011.10.009

zbMATH Keywords

nonlinear programmingglobal convergencelocal superlinear convergencefeasibility safeguarding methodpenalty-free-type algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Global and local convergence of a penalty-free method for nonlinear programming
• An exact penalty function method with global convergence properties for nonlinear programming problems
• Global convergence of a class of smooth penalty methods for semi-infinite programming
• Global convergence of a nonlinear programming method using convex approximations
• On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
• scientific article; zbMATH DE number 764395
• From global to local convergence of interior methods for nonlinear optimization
• Global convergence and finite termination of a class of smooth penalty function algorithms
• Global convergence of a class smooth penalty algorithm of constrained optimization problem
• On the local convergence of a penalty-function-free SQP method

Cites work

• scientific article; zbMATH DE number 3583207 (Why is no real title available?)
• scientific article; zbMATH DE number 556481 (Why is no real title available?)
• scientific article; zbMATH DE number 780774 (Why is no real title available?)
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• A computationally efficient feasible sequential quadratic programming algorithm
• A globally convergent primal-dual interior-point filter method for nonlinear programming
• A new penalty-free-type algorithm based on trust region techniques
• A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization
• CUTE
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• Global and local convergence of a filter line search method for nonlinear programming
• Line Search Filter Methods for Nonlinear Programming: Local Convergence
• Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
• New Results on a Continuously Differentiable Exact Penalty Function
• Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
• Nonlinear programming without a penalty function or a filter
• Nonlinear programming without a penalty function.
• Numerical Optimization
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• On the Global Convergence of a Filter--SQP Algorithm
• On the global convergence of an SLP-filter algorithm that takes EQP steps
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• On the superlinear local convergence of a filter-SQP method
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• Quasi-Newton Methods, Motivation and Theory

Cited in

(11)

• A globally convergent penalty-free method for optimization with equality constraints and simple bounds
• Global and local convergence of a penalty-free method for nonlinear programming
• On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization
• A globally convergent regularized interior point method for constrained optimization
• An adaptively regularized sequential quadratic programming method for equality constrained optimization
• scientific article; zbMATH DE number 4081313 (Why is no real title available?)
• A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
• An interior point method for nonlinear optimization with a quasi-tangential subproblem
• An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization
• Convergence of a stabilized SQP method for equality constrained optimization
• A central path interior point method for nonlinear programming and its local convergence

Describes a project that uses

Uses Software

• CUTE
• Ipopt
• ipfilter
• CUTEr
• LANCELOT

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

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