Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,747,822 papers from all fields of science
Search
Sign In
Create Free Account
Sequential quadratic programming
Known as:
SQP
Sequential quadratic programming (SQP) is an iterative method for nonlinear optimization. SQP methods are used on mathematical problems for which the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
21 relations
Active set method
Augmented Lagrangian method
GNU Octave
Interior point method
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Sequential quadratic programming enhanced backtracking search algorithm
Wenting Zhao
,
Lijin Wang
,
Yilong Yin
,
Bingqing Wang
,
Yuchun Tang
Frontiers of Computer Science
2018
Corpus ID: 4566848
In this paper, we propose a new hybrid method called SQPBSA which combines backtracking search optimization algorithm (BSA) and…
Expand
2007
2007
Optimal Distribution Generation Sizing via Fast Sequential Quadratic Programming
M. F. AlHajri
,
M. El-Hawary
Large Engineering Systems Conference on Power…
2007
Corpus ID: 21948720
In this paper a new methodology is proposed to solve the optimal Distributed Generation (DG) sizing problem. The main feature of…
Expand
2002
2002
Numerical Behavior of a Stabilized SQP Method for Degenerate NLP Problems
El-Sayed M. E. Mostafa
,
L. N. Vicente
,
Stephen J. Wright
Global Constraint Optimization and Constraint…
2002
Corpus ID: 7057820
In this paper we discuss the application of the stabilized SQP method with constraint identification (sSQPa) recently proposed by…
Expand
2002
2002
Global and Local Convergence of Line Search Filter Methods for Nonlinear Programming
Andreas Wächter
,
L. Biegler
2002
Corpus ID: 18683937
Line search methods for nonlinear programming using Fletcher and Leyffer’s filter method, which replaces the traditional merit…
Expand
1999
1999
Sequential quadratic programming methods based on indefinite Hessian approximations
W. Murray
,
Meredith J. Goldsmith
1999
Corpus ID: 125071424
We address the nonlinearly constrained optimization problem: to find a local minimizer for an objective function subject to…
Expand
1997
1997
The Development of the SQP Algorithm for Nonlinear Programming
R. Sargent
1997
Corpus ID: 119851514
The paper traces the steps in the development of the SQP algorithm, describing approaches used to deal with issues such as…
Expand
1995
1995
Global Convergence of Inexact Reduced SQP Methods
H. Jäger
,
E. Sachs
Universität Trier, Mathematik/Informatik…
1995
Corpus ID: 32101094
In this paper we consider infinite dimensional optimization problems with equality constraints. The basic underlying algorithm is…
Expand
1993
1993
Trajectory Optimization Using Sparse Sequential Quadratic Programming
J. Betts
1993
Corpus ID: 115621240
One of the most effective numerical techniques for the solution of trajectory optimization and optimal control problems is the…
Expand
1991
1991
Sequential quadratic programming for certain parameter identification problems
C. Kelley
,
Stephen J. Wright
Mathematical programming
1991
Corpus ID: 28511859
We analyze the method of sequential quadratic programming for equality constrained minimization problems in Hilbert spaces of…
Expand
Highly Cited
1987
Highly Cited
1987
A Schur-complement method for sparse quadratic programming
P. Gill
,
W. Murray
,
M. Saunders
,
M. H. Wright
1987
Corpus ID: 16610729
Abstract : In applying active-set methods to sparse quadratic programs, it is desirable to utilize existing sparse-matrix…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE