The Industrial Internet of Things (IIoT) is a rapidly emerging technology that increases the efficiency and productivity industrial environments by integrating smart sensors devices with internet. advancements in communication technologies have introduced stable connectivity higher data transfer rate IIoT. IIoT generate massive amount information requires intelligent processing techniques for d...

Sequential quadratic programming (SQP) methods solve nonlinear optimization problems by finding an approximate solution of a sequence of quadratic programming (QP) subproblems. Each subproblem involves the minimization of a quadratic model of the objective function subject to the linearized constraints. Depending on the definition of the quadratic model, the QP subproblem may be nonconvex, lead...

A trust-region SQP-filter algorithm of the type introduced by Fletcher and Leyffer [Math. Program., 91 (2002), pp. 239–269] that decomposes the step into its normal and tangential components allows for an approximate solution of the quadratic subproblem and incorporates the safeguarding tests described in Fletcher, Leyffer, and Toint [On the Global Convergence of an SLPFilter Algorithm, Technic...

For mathematical programs with complementarity constraints (MPCC), we propose an active set Newton method which has the property of local quadratic convergence under the MPCC linear independence constraint qualification (MPCC-LICQ) and the standard second-order sufficient condition for optimality (SOSC). Under MPCC-LICQ, this SOSC is equivalent to the piecewise SOSC on branches of MPCC, which i...

For a mathematical program with complementarity constraints (MPCC), we propose an active-set Newton method, which has the property of local quadratic convergence under the MPCC linear independence constraint qualification (MPCC-LICQ) and the standard second-order sufficient condition (SOSC) for optimality. Under MPCC-LICQ, this SOSC is equivalent to the piecewise SOSC on branches of MPCC, which...

In this paper, we propose a converting technique based method to solve nonlinear multi-commodity network flow (NMNF) problems with a large number of capacity constraints and discuss the associated implementation. We have combined this method with a successive quadratic programming (SQP) method and a parallel dual-type (PDt) method possessing decomposition effects. We have tested our method in s...

In this paper, we introduce a constant positive linear dependence condition (CPLD), which is weaker than the Mangasarian–Fromovitz constraint qualification (MFCQ) and the constant rank constraint qualification (CRCQ). We show that a limit point of a sequence of approximating Karush–Kuhn–Tucker (KKT) points is a KKT point if the CPLD holds there. We show that a KKT point satisfying the CPLD and ...

A simple scheme is proposed for handling nonlinear equality constraints in the context of a previously introduced sequential quadratic programming (SQP) algorithm for inequality constrained problems, generating iterates satisfying the constraints. The key is an idea due to Mayne and Polak (Math. Progr., vol. 11, pp. 67{80, 1976) by which nonlinear equality constraints are treated as \"-type con...