A globally and superlinearly convergent feasible QP-free method for nonlinear programming

DOI10.1016/j.amc.2004.09.034zbMath1082.65064OpenAlexW2068304369MaRDI QIDQ2572703

Zhi Bin Zhu

Publication date: 4 November 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.09.034

zbMATH Keywords

global convergenceconstrained optimizationsuperlinear convergencequasi-Newton methodsuccessive quadratic programmingactive set methodQP-free algorithmSQP algorithmquadratic programming free type algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (4)

A globally and superlinearly convergent modified SQP-filter method ⋮ An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization ⋮ A sequential equality constrained quadratic programming algorithm for inequality constrained optimization ⋮ An infeasible active-set QP-free algorithm for general nonlinear programming

Cites Work

• Unnamed Item
• Test example for nonlinear programming codes
• Local analysis of Newton-type methods for variational inequalities and nonlinear programming
• Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• A two-stage feasible directions algorithm for nonlinear constrained optimization
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• A surperlinearly convergent algorithm for constrained optimization problems
• The watchdog technique for forcing convergence in algorithms for constrained optimization
• On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems

This page was built for publication: A globally and superlinearly convergent feasible QP-free method for nonlinear programming