A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Hougardy conjectured that the minimal forbidden subgraphs for the class of SQP graphs are the odd chordless cycles, the complements of odd or even chordless cycles, and some line-graphs of bipartite graphs. Here we prove t...

We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a smooth influence on the model functions, i.e., that function values do not change drastically when inor decrementing an integer value, successive quadratic approximations are applied. The algorithm is stabilized by a tru...

Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first derivatives are available and that the constraint gradients are sparse. We discuss an SQP algorithm th...

Stabilized sequential quadratic programming (SQP) methods for nonlinear optimization are designed to provide a sequence of iterates with fast local convergence regardless of whether or not the active-constraint gradients are linearly dependent. This paper concerns the global convergence properties of a stabilized SQP method with a primal-dual augmented Lagrangian merit function. The proposed me...

Direct boundary value problem methods in combination with SQP iteration have proved to be very successful in solving nonlinear optimal control problems. Such methods use parameterized control functions, discretize the state di erential equations by, e.g., multiple shooting or collocation, and treat the discretized boundary value problem as an equality constraint in a large, nonlinear, constrain...

Phytoplasmas associated with cucumber phyllody (CuP) and squash phyllody (SqP) in Yazd province of Iran were characterized by molecular analyses and biological studies. Orosius albicinctus leafhoppers testing positive for phytoplasma presence by polymerase chain reaction (PCR) successfully transmitted CuP and SqP phytoplasmas to healthy cucumber and squash plants. The phytoplasmas were also tra...

This paper gives an algebraic framework for designing analog lters that are jointly optimized for magnitude, phase, and step responses, and lter quality. We formulate the design problem as a sequential quadratic programming (SQP) problem and use symbolic mathematical software to translate the SQP formulation into workingMATLAB programs to optimize analog lters.

We consider sequential quadratic programming methods (SQP) globalized by linesearch for the standard exact penalty function. It is well known that if the Hessian of the Lagrangian is used in SQP subproblems, the obtained direction may not be of descent for the penalty function. The reason is that the Hessian need not be positive definite, even locally, under any natural assumptions. Thus, if a ...

Output noise is strongly related to input in closed-loop control system, which makes model identification of closed-loop difficult, even unidentified in practice. The forward channel model is chosen to isolate disturbance from the output noise to input, and identified by optimization the dynamic characteristics of the process based on closed-loop operation data. The characteristics parameters o...

Reduced Hessian Successive Quadratic Programming (SQP) is well suited for the solution of large-scale process optimization problems with many variables and constraints but few degrees of freedom. The reduced space method involves four major steps: an initial preprocessing phase followed by an iterative procedure which requires the solution oj a set of nonlinear equations, a QP subproblem and a ...