A modified SQP method with nonmonotone technique and its global convergence
type: Item
instance of: scholarly article
title: A modified SQP method with nonmonotone technique and its global convergence
zbMATH Open document ID: 1165.90684
author: Ke Su
author: Zhensheng Yu
publication date: 2009-07-13T00:00:00Z
Mathematics Subject Classification ID: 90C55
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5577905
zbMATH Keywords: SQP method
zbMATH Keywords: nonmonotone technique
zbMATH Keywords: global convergence
MaRDI profile type: Publication
full work available at URL: j.camwa.2008.05.030
OpenAlex ID: W2039294531
cites work: A globally convergent method for nonlinear programming
cites work: Global convergence on an active set SQP for inequality constrained optimization
cites work: A note on quasi-newton formulae for sparse second derivative matrices
cites work: Q3915937
cites work: Nonlinear programming without a penalty function.
cites work: On the global convergence of an SLP-filter algorithm that takes EQP steps
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: A Pattern Search Filter Method for Nonlinear Programming without Derivatives
cites work: A new filter method for solving nonlinear complementarity problems
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
cites work: A truncated Newton method with non-monotone line search for unconstrained optimization
cites work: A class on nonmonotone stabilization methods in unconstrained optimization
cites work: Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
cites work: Global convergence of nonmonotone descent methods for unconstrained optimization problems
cites work: An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
cites work: A new nonmonotone line search technique for unconstrained optimization
cites work: Nonmonotonic trust region algorithm
cites work: Nonmonotone adaptive trust-region method for unconstrained optimization problems
cites work: A nonmonotone trust region algorithm for equality constrained optimization
cites work: A nonmonotone trust region algorithm for unconstrained nonsmooth optimization
cites work: Nonmonotone trust region method for solving optimization problems
cites work: Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
cites work: A robust sequential quadratic programming method
cites work: A Robust Algorithm for Optimization with General Equality and Inequality Constraints
cites work: A modified SQP method with nonmonotone linesearch technique.
cites work: A modified SQP method and its global convergence
cites work: Q4709693
cites work: A trust region filter method for general non-linear programming
cites work: Test examples for nonlinear programming codes
DOI: 10.1016/J.CAMWA.2008.05.030
published in: Computers & Mathematics with Applications
Recommended article: A modified nonmonotone SQP method
Recommended article: A modified SQP method and its global convergence
Recommended article: Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
Recommended article: A MODIFIED SQP METHOD WITH NONMONOTONE LINE SEARCH TECHNIQUE WITHOUT A PENALTY OR A FILTER FOR NONLINEAR INEQUALITY CONSTRAINED OPTIMIZATION
Recommended article: Q3516592
Recommended article: Q4241179
Recommended article: Q4338261
Recommended article: A modified SQP method with nonmonotone linesearch technique.
Recommended article: Q4821365
description: scientific article; zbMATH DE number 5577905