Results 1 to 10 of about 10,435 (267)
Set intersection problems: supporting hyperplanes and quadratic programming [PDF]
We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the intersection of closed convex sets, we propose an algorithm that, like Dykstra's algorithm, converges strongly in a ...
openaire +2 more sources
Optimizing the location and capacity of flexible resources is critical. The increase in the permeability of distributed generation (DG) causes the net load to drastically fluctuate, which sharply increases flexibility demand for the distribution network.
Jie Wang +4 more
doaj +1 more source
This paper analyses the solution of a specific quadratic sub-problem, along with its possible applications, within both constrained and unconstrained Nonlinear Programming frameworks.
Giovanni Fasano +2 more
doaj +1 more source
Portfolio optimization using particle swarm optimization method [PDF]
The Markowitz’s optimization problem is considered as a standard quadratic programming problem that has exact mathematical solutions. Considering real world limits and conditions, the portfolio optimization problem is a mixed quadratic and integer ...
Reza Raei, Hedayat Alibeiki
doaj
Using the positive transmission way of modified gear,a mathematical optimization model of the encased differential herringbone gear transmission system is set up by taking the lightest gear weight of this transmission system as the optimization objective.
朱增宝, 朱如鹏, 尹敏
doaj
The Bipartite Boolean Quadratic Programming Problem
We consider the Bipartite Boolean Quadratic Programming Problem (BQP01), which generalizes the well-known Boolean Quadratic Programming Problem (QP01). The model has applications in graph theory, matrix factorization and bioinformatics, among others. BQP01 is NP-hard.
openaire +2 more sources
Primal-Dual Method of Solving Convex Quadratic Programming Problems [PDF]
This paper presents a primal-dual method for solving quadratic programming problems. The method is based on finding an exact solution of a finite sequence of unconstrained quadratic prigraamming problems and on finding an aproximative solution of ...
V. Moraru
doaj
An algorithm for solving quadratic programming problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Cross-ambiguity Function Shaping Through Fractional Quadratic Programming
Due to the mismatch between transmit waveforms and receive filters, Cross-Ambiguity Function (CAF) shaping plays an important role in the design of cognitive radar waveforms and allows more freedom for waveform optimization problem than conventional ...
Chen YANG +4 more
doaj +1 more source
An unconstrained binary quadratic programming for the maximum independent set problem
For a given graph G = (V, E) the maximum independent set problem is to find the largest subset of pairwise nonadjacent vertices. We propose a new model which is a reformulation of the maximum independent set problem as an unconstrained quadratic binary ...
Sidi Mohamed Douiri, Souad Elbernoussi
doaj

