2008 Eighth International Conference on Intelligent Systems Design and Applications 2008
DOI: 10.1109/isda.2008.162
|View full text |Cite
|
Sign up to set email alerts
|

Sequential Quadratic Programming Based on IPM for Constrained Nonlinear Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…At each iteration, the Quasi-Newton updating method is adopted to get an approximation of the Hessian matrix of the Lagrangian function. This approximation is used to get the solution of a quadratic programming sub-problem, and this solution is adopted to update the approximation [25].…”
Section: Optimization Methodologymentioning
confidence: 99%
“…At each iteration, the Quasi-Newton updating method is adopted to get an approximation of the Hessian matrix of the Lagrangian function. This approximation is used to get the solution of a quadratic programming sub-problem, and this solution is adopted to update the approximation [25].…”
Section: Optimization Methodologymentioning
confidence: 99%
“…It gets the optimal solution by generating a series of iterations with Lagrange multipliers. So the constrained optimization problem can be transformed into a sub problem that would be used as the basis of an iterative process [15].…”
Section: E Optimization Methodsmentioning
confidence: 99%