An improved sequential quadratic programming algorithm for solving general nonlinear programming problems

DOI10.1016/j.jmaa.2013.06.052zbMath1306.90174arXiv1206.3359OpenAlexW2071429864MaRDI QIDQ2257747

Chuan-Hao Guo, Jin-Bao Jian, Yan-Qin Bai

Publication date: 2 March 2015

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.3359

zbMATH Keywords

global convergencesequential quadratic programmingsuperlinear convergencemethod of quasi-strongly sub-feasible directionsgeneral nonlinear programming

Mathematics Subject Classification ID

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

Related Items

A superlinearly convergent hybrid algorithm for solving nonlinear programming ⋮ Unnamed Item

Uses Software

• SNOPT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequential systems of linear equations method for general constrained optimization without strict complementarity
• A trust region SQP-filter method for nonlinear second-order cone programming
• A type of efficient feasible SQP algorithms for inequality constrained optimization
• Test example for nonlinear programming codes
• An SQP method for general nonlinear programs using only equality constrained subproblems
• A feasible SQP method for nonlinear programming
• Exact penalty function algorithm with simple updating of the penalty parameter
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
• A non-monotone line search multidimensional filter-SQP method for general nonlinear programming
• A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for 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
• Feasible directions algorithms for optimization problems with equality and inequality constraints
• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• CUTEr and SifDec
• A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization.
• Benchmarking optimization software with performance profiles.

This page was built for publication: An improved sequential quadratic programming algorithm for solving general nonlinear programming problems