A trust-region SQP method without a penalty or a filter for nonlinear programming

DOI10.1016/j.cam.2014.12.021zbMath1310.90121OpenAlexW1998477935MaRDI QIDQ2515095

Mingxia Huang, Pu, Dingguo

Publication date: 11 February 2015

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

Full work available at URL: https://doi.org/10.1016/j.cam.2014.12.021

zbMATH Keywords

global convergencenonlinear programmingtrust-regionSQP

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items

A novel multidimensional penalty‐free approach for constrained optimal control of switched control systems ⋮ A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application ⋮ Two-phase-SQP method with higher-order convergence property ⋮ A nonlinear interval portfolio selection model and its application in banks ⋮ Sequential quadratic programming method for nonlinear least squares estimation and its application ⋮ Convergence analysis of a trust-region multidimensional filter method for nonlinear complementarity problems

Uses Software

• SNOPT

Cites Work

• Unnamed Item
• Unnamed Item
• A nonmonotone filter method for nonlinear optimization
• Nonlinear programming without a penalty function or a filter
• A globally convergent method for nonlinear programming
• Test example for nonlinear programming codes
• On the global convergence of an SLP-filter algorithm that takes EQP steps
• On the superlinear local convergence of a filter-SQP method
• A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
• Dynamic Control of Infeasibility in Equality Constrained Optimization
• Numerical Optimization
• A Trust Region Method for Solving Generalized Complementarity Problems
• A Globally Convergent Filter Method for Nonlinear Programming
• On the Global Convergence of a Filter--SQP Algorithm
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
• Benchmarking optimization software with performance profiles.
• Nonlinear programming without a penalty function.
• Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.