Quadratic Programming Problem Research Articles

Motor online novelty detection scheme based on one-class hyperdisk

Abstract Online novelty detection is of great importance in the series production of motors. This study developed an online novelty detection scheme for motors based on a one-class hyperdisk (OCHD) model. In the OCHD approach, the decision boundary is estimated using a hyperdisk (HD), which is derived from the training sample set. The HD model addresses the underestimation issue commonly associated with convex-hull-based methods by providing a more accurate estimation of the class region. Furthermore, an optimal separating hyperplane is constructed at the nearest point on the HD by solving a quadratically constrained quadratic program problem. Statistical features refined by the Laplacian score are employed in the proposed novelty detection scheme. This study introduces an online novelty detection scheme for assessing motor quality in actual series production. The test results from the offline experiment demonstrate the superiority of the OCHD method. Datasets collected at the end of the production line were evaluated using the proposed novelty detection scheme. The inspection results for motor components confirm that the proposed method effectively identifies faulty motors during the series production process.

Absolute Value Inequality SVM for the PU Learning Problem

Positive and unlabeled learning (PU learning) is a significant binary classification task in machine learning; it focuses on training accurate classifiers using positive data and unlabeled data. Most of the works in this area are based on a two-step strategy: the first step is to identify reliable negative examples from unlabeled examples, and the second step is to construct the classifiers based on the positive examples and the identified reliable negative examples using supervised learning methods. However, these methods always underutilize the remaining unlabeled data, which limits the performance of PU learning. Furthermore, many methods require the iterative solution of the formulated quadratic programming problems to obtain the final classifier, resulting in a large computational cost. In this paper, we propose a new method called the absolute value inequality support vector machine, which applies the concept of eccentricity to select reliable negative examples from unlabeled data and then constructs a classifier based on the positive examples, the selected negative examples, and the remaining unlabeled data. In addition, we apply a hyperparameter optimization technique to automatically search and select the optimal parameter values in the proposed algorithm. Numerical experimental results on ten real-world datasets demonstrate that our method is better than the other three benchmark algorithms.

Nonparametric Modelling of Ship Dynamics Using Puma Optimizer Algorithm-Optimized Twin Support Vector Regression

Ship dynamic models serve as the foundation for designing ship controllers, trajectory planning, and obstacle avoidance. Support vector regression (SVR) is a commonly used nonparametric modelling method for ship dynamics. Achieving high accuracy SVR models requires a substantial amount of training samples. Additionally, as the number of training samples increases, the computational efficiency for solving the quadratic programming problem (QPP) of SVR decreases. Ship controllers demand dynamic models with both high accuracy and computational efficiency. Therefore, to enhance the prediction accuracy and computational efficiency of SVR, this paper proposes a nonparametric modelling method based on twin SVR (TSVR). TSVR replaces a large QPP with a set of smaller QPPs, significantly enhancing generalizability and computational efficiency. To further improve the predictive accuracy of TSVR, the puma optimizer algorithm is employed to determine the optimal hyperparameters. The performance of the proposed method is validated using a Mariner class vessel. Gaussian white noise is introduced into the modelling data to simulate measurement error. The TSVR model accurately predicts various zigzag and turning circle manoeuvring motions under disturbance conditions, demonstrating its robustness and generalizability. Compared to the SVR model, the TSVR model achieves lower root mean square error and computational time, confirming its superior predictive accuracy and computational efficiency.

Uncertainty relation and the constrained quadratic programming

The uncertainty relation is a fundamental concept in quantum theory, plays a pivotal role in various quantum information processing tasks. In this study, we explore the additive uncertainty relation pertaining to two or more observables, in terms of their variance, by utilizing the generalized Gell-Mann representation in qudit systems. We find that the tight state-independent lower bound of the variance sum can be characterized as a quadratic programming problem with nonlinear constraints in optimization theory. As illustrative examples, we derive analytical solutions for these quadratic programming problems in lower-dimensional systems, which align with the state-independent lower bounds. Additionally, we introduce a numerical algorithm tailored for solving these quadratic programming instances, highlighting its efficiency and accuracy. The advantage of our approach lies in its potential ability to simultaneously achieve the optimal value of the quadratic programming problem with nonlinear constraints but also precisely identify the extremal state where this optimal value is attained. This enables us to establish a tight state-independent lower bound for the sum of variances, and further identify the extremal state at which this lower bound is realized.

Explicit machine learning-based model predictive control of nonlinear processes via multi-parametric programming

Machine learning-based model predictive control (ML-MPC) has been developed to control nonlinear processes with unknown first-principles models. While ML models can capture nonlinear dynamics of complex systems, the complexity of ML models leads to increased computation time for real-time implementation of ML-MPC. To address this issue, in this work, we propose an explicit ML-MPC framework for nonlinear processes using multi-parametric programming. Specifically, a self-adaptive approximation algorithm is first developed to obtain a piecewise linear affine function that approximates the behaviors of ML models. Then, multi-parametric quadratic programming (mpQP) problems are formulated to generate the solution map for states in discretized state–space. Furthermore, to accelerate the implementation of explicit ML-MPC, a neighbor-first search algorithm is developed. Finally, an example of a chemical reactor is used to demonstrate the effectiveness of the explicit ML-MPC.

Model Predictive Control for Trajectory Planning Considering Constraints on Vertical Load Variation

To address the issue of centrifugal force affecting the vertical load during the stability and trajectory planning of autonomous vehicles during high-speed cornering and obstacle avoidance, a model predictive control of trajectory planning and tracking is proposed that considers the roll factor using only a two-degrees-of-freedom vehicle dynamics model. Firstly, a trajectory planning controller is designed. As a predictive model, a dual-track two-degrees-of-freedom vehicle dynamics model is established. This model describes the relationship between tire lateral forces and vertical loads using a quadratic nonlinear tire model. To reflect the actual dynamic state of the vehicle, the controller incorporates a nonlinear constraint that considers vertical load variations. The nonlinear optimization problem is transformed into a simplified quadratic programming problem by using the Jacobian matrix method to linearize the constraints. By fitting a fourth-degree polynomial curve to the discrete points calculated by the replanning algorithm, an optimal collision-free trajectory is obtained. Secondly, an MPC trajectory tracking controller is designed to control the vehicle in real time along the optimal trajectory from the planning, incorporating control quantity constraints, control increment constraints, and lateral angle constraints to maintain the vehicle’s motion state. We transform the trajectory tracking control problem into a quadratic programming problem, solving for the optimal control sequence for the autonomous vehicle to track the trajectory, achieving an optimized solution and rolling time domain control. Finally, the effectiveness of the vehicle’s obstacle avoidance planning and tracking under high-speed double-lane-change maneuver conditions is validated using the Simulink simulation platform. The results indicate that the designed planning and tracking controllers effectively improve the obstacle avoidance planning and tracking control for high-speed autonomous vehicles.

Fast quadratic model predictive control based on sensitivity analysis and Wolfe method

AbstractThis paper proposes a new algorithm based on sensitivity analysis and the Wolfe method to solve a sequence of parametric quadratic programming (QP) problems such as those that arise in quadratic model predictive control (QMPC). The Wolfe method, based on Karush–Kuhn–Tucker conditions, has been used to convert parametric QP problems to parametric linear programming (LP) problems, and then the sensitivity analysis is applied to solve the sequence of the parametric LP problems. This strategy obtains sensitivity analysis‐based QMPC (SA‐QMPC) algorithm. It is proved that the computational complexity of SA‐QMPC is for a region of the initial conditions and for sufficiently small sampling time and all initial conditions, where and are the horizon time and dimension of the state vector, respectively. Numerical results indicate the potential and properties of the proposed algorithm.

Efficiently Refining Beampattern in FDA-MIMO Radar via Alternating Manifold Optimization for Maximizing Signal-to-Interference-Noise Ratio

Joint transceiver beamforming is a fundamental and crucial research task in the field of signal processing. Despite extensive efforts made in recent years, the joint transceiver beamforming of frequency diverse array (FDA)-based multiple-input and multiple-output (MIMO) radar has received relatively less attention and is confronted with some tricky challenges, such as range–angle decoupling and the interaction between multiple performance metrics. In this paper, we initially derive the generalized ambiguity function of the FDA-MIMO radar to explore the intrinsic correlation between its waveform design and resolution. Following that, the joint beamforming optimization is formulated as a nonconvex bivariate quadratic programming problem (NBQP) with the aim of maximizing the Signal-to-Interference-Noise Ratio (SINR) of the FDA-MIMO radar system. Building upon this, we introduce an innovative alternating manifold optimization with nested iteration (AMO-NI) algorithm to address the NBQP. By incorporating manifold optimization into iterative updates of transmit waveform and receiving filter, the AMO-NI algorithm considers the interdependencies among the optimization variables. The algorithm efficiently and expeditiously finds global optimum solutions within a finite number of iterations. Compared with other methods, our approach yields a superior beampattern and higher SINR.

Hybrid model predictive control for vehicle trajectory tracking with integrated attitude adjustment

This paper presents a vehicle trajectory tracking method that integrates attitude adjustment. The method utilizes the asymmetric adjustment of the damping of the adjustable damping shock absorber to lift the left and right vehicle body and carry out the attitude adjustment of the vehicle. Additionally, it actively tilts toward the inside of the curve during turning. In order to address the nonlinear constraints of damping asymmetry regulation and the mixed logic relationship between suspension asymmetry damping switching and left and right body lifting during body attitude regulation, a mixed logic dynamic system (MLD) for vehicle attitude adjustment is established. Subsequently, the vehicle trajectory tracking controller is designed using the hybrid model predictive control theory (HMPC), which integrates active steering control and attitude adjustment. The optimal control problem of hybrid systems is transformed into a hybrid integer quadratic programming problem and solved through finite time domain rolling optimization. The effectiveness of the proposed integrated controller is confirmed through Simulink simulation. Compared with pure tracking control and roll tracking control with zero roll angle as the control target, this controller demonstrates its ability to effectively track the reference trajectory and enhance the vehicle’s dynamic performance.

Hospital Management Practice of Combined Prediction Method Based on Neural Network

In this article, the outpatient volume, hospitalization income and drug demand in hospital management are taken as the research objects, and a neural network combined prediction model is established to predict the outpatient volume with the fitting prediction results of cubic polynomial regression model and grey model as the input of the network and the actual statistical outpatient volume as the output. Lasso variable selection method is used to determine the main indexes affecting the income of inpatients in hospital, and a prediction model combining grey prediction and artificial neural network is established to predict the income of inpatients in hospital. By studying the key characteristics of hospital drug demand, BP neural network, RBF neural network and GRNN generalized regression neural network are selected to predict the drug demand. By solving the quadratic programming problem and according to the weight rules, a combination forecasting model based on neural network is established to predict the drug demand, and the accuracy and stability of the model are evaluated.

Research on collaborative adaptive cruise control based on MPC and improved spacing policy

A Cooperative Adaptive Cruise Control (CACC) algorithm based on Model Predictive Control (MPC) and an improved spacing policy is proposed in this study to address the current issues of low road utilization and inadequate dynamic regulation during platoon driving. First and foremost, the state of the leader vehicle and the minimum safe following distance are incorporated into the spacing policy to create an enhanced constant time headway (CTH) spacing policy. Secondly, following the MPC principle, the optimization problem of vehicle platoon is converted into a constrained quadratic programming problem that fulfills the requirements of driving safety, following distance, and ride comfort in a platoon. Finally, six-homogeneous-vehicle platoon is constructed for simulation verification, and the results show that the designed algorithm can not only ensure the string stability of platoon, but also effectively improve the road utilization rate. And in the vehicle of platoon cut-in/cut-out conditions, CACC is proven to have good ability of dynamically adjusting and restoring platoon stability.

Generalization Memorization Machine with Zero Empirical Risk for Classification

Classifying the training data correctly without over-fitting is one of the goals in machine learning. In this paper, we propose a general Generalization Memorization Machine (GMM) to obtain zero empirical risk with better generalization. The widely applied loss-based learning models can be extended by the GMM to improve their memorization and generalization abilities. Specifically, we propose two new models based on the GMM, called Hard Generalization Memorization Machine (HGMM) and Soft Generalization Memorization Machine (SGMM). Both HGMM and SGMM obtain zero empirical risks with well generalization, and the SGMM further improves the capacity and applicability of HGMM. The optimization problems in the proposed models are quadratic programming problems and could be solved efficiently. Additionally, the recently proposed generalization memorization kernel and the corresponding support vector machine are the special cases of our SGMM. Experimental results demonstrate the effectiveness of the proposed HGMM and SGMM both on memorization and generalization.

Data reduction for SVM training using density-based border identification.

Numerous classification and regression problems have extensively used Support Vector Machines (SVMs). However, the SVM approach is less practical for large datasets because of its processing cost. This is primarily due to the requirement of optimizing a quadratic programming problem to determine the decision boundary during training. As a result, methods for selecting data instances that have a better likelihood of being chosen as support vectors by the SVM algorithm have been developed to help minimize the bulk of training data. This paper presents a density-based method, called Density-based Border Identification (DBI), in addition to four different variations of the method, for the lessening of the SVM training data through the extraction of a layer of border instances. For higher-dimensional datasets, the extraction is performed on lower-dimensional embeddings obtained by Uniform Manifold Approximation and Projection (UMAP), and the resulting subset can be repetitively used for SVM training in higher dimensions. Experimental findings on different datasets, such as Banana, USPS, and Adult9a, have shown that the best-performing variations of the proposed method effectively reduced the size of the training data and achieved acceptable training and prediction speedups while maintaining an adequate classification accuracy compared to training on the original dataset. These results, as well as comparisons to a selection of related state-of-the-art methods from the literature, such as Border Point extraction based on Locality-Sensitive Hashing (BPLSH), Clustering-Based Convex Hull (CBCH), and Shell Extraction (SE), suggest that our proposed methods are effective and potentially useful.

Iterative distributed model predictive control for nonlinear systems with coupled non‐convex constraints and costs

AbstractThis paper proposes a distributed model predictive control (DMPC) algorithm for dynamic decoupled discrete‐time nonlinear systems subject to nonlinear (maybe non‐convex) coupled constraints and costs. Solving the resulting nonlinear optimal control problem (OCP) using a DMPC algorithm that is fully distributed, termination‐flexible, and recursively feasible for nonlinear systems with coupled constraints and costs remains an open problem. To address this, we propose a fully distributed and globally convergence‐guaranteed framework called inexact distributed sequential quadratic programming (IDSQP) for solving the OCP at each time step. Specifically, the proposed IDSQP framework has the following advantages: (i) it uses a distributed dual fast gradient approach for solving inner quadratic programming problems, enabling fully distributed execution; (ii) it can handle the adverse effects of inexact (insufficient) calculation of each internal quadratic programming problem caused by early termination of iterations, thereby saving computational time; and (iii) it employs distributed globalization techniques to eliminate the need for an initial guess of the solution. Under reasonable assumptions, the proposed DMPC algorithm ensures the recursive feasibility and stability of the entire closed‐loop system. We conduct simulation experiments on multi‐agent formation control with non‐convex collision avoidance constraints and compare the results against several benchmarks to verify the performance of the proposed DMPC method.

Application of support vector machine system introducing multiple submodels in data mining

As the information age develops, the scale and form of data become more diverse and diverse. Therefore, people need to use effective means to process information. For large-scale data mining problems, a clustering-based kernel matrix inner product filtering method is introduced to decompose the original quadratic programming problem into multiple sub-problems to support parallel training. And a Spark-based multiple submodels parallel support vector machine is proposed. By introducing open-source tools such as OpenCV, image feature extraction can be performed on large-scale video data. Finally, combined with the designed parallel support vector machine algorithm, video facial and expression recognition is carried out. These experiments confirmed that the research method achieved a maximum acceleration ratio of 2090 times when processing Covtype datasets. The research model could achieve an accuracy of over 99 %. Under the maximum data scale experiment, the research model improved prediction accuracy by 21 percentage points with an acceptable additional time cost of about 4 min only. Task parallel processing could more fully utilize cluster performance, increasing by approximately 3.5 m/s2 from 30 to 150 cores. The research model had the highest recognition accuracy for facial expressions, further demonstrating the effectiveness and superiority of this method. The research method has improved the efficiency of big data analysis and mining, and is of great significance in parallel analysis of video data.

Deep Learning based Model Predictive Controller on a Magnetic Levitation Ball System

The magnetic levitation (maglev) ball system is a prototypical Single-Input-Single-Output (SISO) system, characterized by its pronounced nonlinearity, rapid response, and open-loop instability. It serves as the basis for many industrial devices. For describing the dynamics of the maglev ball system precisely in the pseudo linear model, the long short-term memory (LSTM) based auto-regressive model with exogenous input variables (LSTM-ARX) is proposed. Firstly, the LSTM network is modified by incorporating the auto-regressive structure with respect to sequence input, allowing it to deduce a locally linearized model without the need for Taylor expansion. Then, the LSTM-ARX model is transformed into a linear parameter varying (LPV) state space model, and upon this foundation, a model predictive controller (MPC) is proposed. Specifically, when deducing the MPC, the deep learning-based model is linearized by fixing its state input at the current state, so that the nonlinear, non-convex optimization problem can be converted to a finite-horizon quadratic programming problem, thereby deriving the explicit form of MPC. To further enhance the efficiency of the controller in real-time control tasks, a predictive functional controller (PFC) is proposed. It employs multiple nonlinear functions to fit the control sequence, thereby reducing the number of decision variables of the on-line optimization problem in MPC. The proposed controller was successfully applied to the real-time control of the maglev ball system. Simulation and real-time control experiments have validated the improvement in transient performance and efficiency of the LSTM-ARX model-based PFC (LSTM-ARX-PFC).

A recurrent neural network approach for nonconvex interval quadratic programming

In the paper, a new approach is presented to tackle an interval optimization problem with nonconvex interval objective function and affine interval equality and inequality constraints utilizing a recurrent neural network. The approach involves converting the nonconvex interval quadratic programming into a cubic optimization via convex combinations and considering its weight as a decision variable. The recurrent neural network is then established to solve the cubic optimization through subgradient techniques and an exterior penalty function method. Moreover, it is proven that there is a unique global solution to the recurrent neural network, and its trajectory can reach the feasible region in a finite time and remain there. Additionally, it is demonstrated that the trajectory of recurrent neural network converges exponentially or in finite time towards a singleton belonging to the set of constrained critical points of the cubic optimization. This approach is beneficial for interval quadratic programming problems where the weight is unknown or challenging to determine in practical applications. Finally, the effectiveness of this approach is verified through two numerical examples.

Optimised operation of integrated community energy system considering integrated energy pricing strategy: A two-layer Stackelberg game approach

Aiming at the problems of new energy absorption and inter-subject interest conflict in the integrated community energy system, this study proposed an integrated energy pricing strategy that considered the interconversion of various energy sources and built a two-layer optimisation model of the electric-gas-heat‑hydrogen interconnection integrated community energy system. The upper-layer operator model maximises the revenue by setting energy price and selling energy to users. The lower-layer users model minimises the energy cost by actively adjusting energy usage strategy according to energy price. The two sides rationally pursue the maximisation of their respective interests, and the process of bargaining can be described by Stackelberg game. The model is also considered for combining the characteristics of elastic load and vehicle-to-grid on the demand side and operates jointly with the bus battery swapping station and two-stage power-to-gas for optimizing system operation. Through theoretical derivation, it is proved that there is a unique Stackelberg equilibrium solution for the proposed game model. Further, the two-layer optimisation model is transformed into a mixed integer quadratic programming problem by applying the Karush-Kuhn-Tucher optimal condition, linear relaxation technique, and duality theorem. Finally, the global optimal energy price is obtained by solving the converted model. The optimisation results in different scenarios show that the proposed model and method not only protect the interests of the operator and users but also improve the wind power absorption capacity of the community and reduce the load fluctuation.

Convex Quadratic Programming for Computing Geodesic Distances on Triangle Meshes

Querying the geodesic distance field on a given smooth surface is a fundamental research pursuit in computer graphics. Both accuracy and smoothness serve as common indicators for evaluating geodesic algorithms. In this study, we argue that ensuring that the norm of the triangle-wise estimated gradients is not larger than 1 is preferable compared to the widely used eikonal condition. Inspired by this, we formulate the geodesic distance field problem as a Quadratically Constrained Linear Programming (QCLP) problem. This formulation can be further adapted into a Quadratically Constrained Quadratic Programming (QCQP) problem by incorporating considerations for smoothness requirements. Specifically, when enforcing a Hessian-energy-based smoothing term, our formulation, named QCQP-Hessian, effectively mitigates the cusps in the geodesic isolines within the near-ridge area while maintaining accuracy in the off-ridge area. We conducted extensive experiments to demonstrate the accuracy and smoothness advantages of QCQP-Hessian.

Multi-View Randomized Kernel Classification via Nonconvex Optimization

Multi kernel learning (MKL) is a representative supervised multi-view learning method widely applied in multi-modal and multi-view applications. MKL aims to classify data by integrating complementary information from predefined kernels. Although existing MKL methods achieve promising performance, they fail to consider the tradeoff between diversity and classification accuracy of kernels, preventing further improvement of classification performance. In this paper, we tackle this problem by generating a number of high-quality base learning kernels and selecting a kernel subset with maximum pairwise diversity and minimum generalization errors. We first formulate this idea as a nonconvex quadratic integer programming problem. Then we transform this nonconvex problem into a convex optimization problem and prove it is equivalent to a semidefinite relaxation problem, which a semidefinite-based branch-and-bound algorithm can quickly solve. Experimental results on the real-world datasets demonstrate the superiority of the proposed method. The results also show that our method works for the support vector machine (SVM) classifier and other state-of-the-art kernel classifiers.