A modified SQP method with nonmonotone linesearch technique.

DOI10.1023/A:1011942228555zbMath1068.90616OpenAlexW1592689579MaRDI QIDQ5954203

Ju-liang Zhang, Xiang-Sun Zhang

Publication date: 2001

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011942228555

zbMATH Keywords

Global optimizationConcave minimizationConvexification methodMonotone optimizationReliability optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items (13)

Nonmonotone algorithm for minimax optimization problems ⋮ An adaptive nonmonotone trust-region method with curvilinear search for minimax problem ⋮ A globally and superlinearly convergent modified SQP-filter method ⋮ Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization ⋮ A modified SQP method and its global convergence ⋮ A trust region SQP-filter method for nonlinear second-order cone programming ⋮ Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems ⋮ A kind of nonmonotone filter method for nonlinear complementarity problem ⋮ An SQP-filter method for inequality constrained optimization and its global convergence ⋮ Global convergence of a robust filter SQP algorithm ⋮ A modified SQP-filter method and its global convergence ⋮ A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization ⋮ A modified SQP method with nonmonotone technique and its global convergence

This page was built for publication: A modified SQP method with nonmonotone linesearch technique.