Results 41 to 50 of about 7,645,857 (241)
International Journal of Distributed Sensor Networks, 2020 Power load forecasting is an important guarantee of safe, stable, and economic operation of power systems. It is appropriate to use interval data to represent fuzzy information in power load forecasting.
Xianfei Yang, Xiang Yu, Hui Lu
doaj +1 more source
Safety Verification and Robustness Analysis of Neural Networks via Quadratic Constraints and Semidefinite Programming [PDF]
IEEE Transactions on Automatic Control, 2019 Certifying the safety or robustness of neural networks against input uncertainties and adversarial attacks is an emerging challenge in the area of safe machine learning and control.
Mahyar Fazlyab, M. Morari, George Pappas
semanticscholar +1 more source
Tightening a Discrete Formulation of the Quadratic Assignment Problem
Chemical Engineering Transactions, 2013 The quadratic assignment problem is a well studied and notoriously difficult combinatorial problem. Recently, a discrete linear formulation of the quadratic assignment problem was presented that solved five previously unsolved instances from the ...
A. Nyberg, T. Westerlund
doaj +1 more source
A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
, 2009 We consider an inverse problem arising from the semi-definite quadratic programming (SDQP) problem. We represent this problem as a cone-constrained minimization problem and its dual (denoted ISDQD) is a semismoothly differentiable (SC^1) convex ...
Xian-Tao Xiao +2 more
semanticscholar +1 more source
A Rank-Two Feasible Direction Algorithm for the Binary Quadratic Programming
Journal of Applied Mathematics, 2013 Based on the semidefinite programming relaxation of the binary quadratic programming, a rank-two feasible direction algorithm is presented. The proposed algorithm restricts the rank of matrix variable to be two in the semidefinite programming relaxation ...
Xuewen Mu, Yaling Zhang
doaj +1 more source
An accelerating algorithm for globally solving nonconvex quadratic programming
Journal of Inequalities and Applications, 2018 To globally solve a nonconvex quadratic programming problem, this paper presents an accelerating linearizing algorithm based on the framework of the branch-and-bound method. By utilizing a new linear relaxation approach, the initial quadratic programming
Li Ge, Sanyang Liu
doaj +1 more source
IEEE Access, 2022 In low earth orbit (LEO) satellite communication systems, the limited energy supply capacity and the difficulty in obtaining channel state information (CSI) are the practical challenges.
Yang Liu +3 more
doaj +1 more source
Open Computer Science, 2020 The problem of maximizing a linear function with linear and quadratic constraints is considered. The solution of the problem is obtained in a constructive form using the Lagrange function and the optimality conditions.
Gorelik Victor, Zolotova Tatiana
doaj +1 more source
Energy Reports, 2020 Operation schedule for microgrids has an important role to manage the electric power supply and demand efficiently. This paper presents a problem formulation and its solution method to obtain a coordinated operation schedule of controllable components in
Hirotaka Takano +3 more
doaj +1 more source
A Simple SQP Algorithm for Constrained Finite Minimax Problems
The Scientific World Journal, 2014 A simple sequential quadratic programming method is proposed to solve the constrained minimax problem. At each iteration, through introducing an auxiliary variable, the descent direction is given by solving only one quadratic programming.
Lirong Wang, Zhijun Luo
doaj +1 more source