Results 1  10
of
2,959
Consider the Quadratic Programming problem:
, 2004
"... Abstract. A quadratic programming problem with positive definite Hessian and bound constraints is solved, using a Lagrange multiplier approach. The proposed method falls in the category of exterior point, active set techniques. An iteration of our algorithm modifies both the minimization parameters ..."
Abstract
 Add to MetaCart
Abstract. A quadratic programming problem with positive definite Hessian and bound constraints is solved, using a Lagrange multiplier approach. The proposed method falls in the category of exterior point, active set techniques. An iteration of our algorithm modifies both the minimization parameters
A note on permutations for quadratic programming problems
, 2006
"... 1 A note on permutations for quadratic programming problems ..."
An Algorithm for Solving Quadratic Programming Problems
"... Herein is investigated the method of solution of quadratic programming problems. The algorithm is based on the effective selection of constraints. Quadratic programming with constraintsequalities are solved with the help of an algorithm, so that matrix inversion is avoided, because of the more conve ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Herein is investigated the method of solution of quadratic programming problems. The algorithm is based on the effective selection of constraints. Quadratic programming with constraintsequalities are solved with the help of an algorithm, so that matrix inversion is avoided, because of the more
ON PARAMETRIC LINEAR AND QUADRATIC PROGRAMMING PROBLEMS
, 1981
"... An algorithm is described for determining the optimal solution of parametric linear and quadratic programming problems as an explicit piecewise linear function of the parameter. Each linear function is uniquely determined by an appropriate subset of active constraints. For every critical value of ..."
Abstract
 Add to MetaCart
An algorithm is described for determining the optimal solution of parametric linear and quadratic programming problems as an explicit piecewise linear function of the parameter. Each linear function is uniquely determined by an appropriate subset of active constraints. For every critical value
On the Solution of Parametric BiLevel Quadratic Programming Problem
"... Abstract This paper presents a parametric bilevel quadratic programming problem with random rough coefficient in objective functions. An approach combines the convert technique of rough coefficient and Stackelberg strategy. An auxiliary problem is discussed and an algorithm as well as an example i ..."
Abstract
 Add to MetaCart
Abstract This paper presents a parametric bilevel quadratic programming problem with random rough coefficient in objective functions. An approach combines the convert technique of rough coefficient and Stackelberg strategy. An auxiliary problem is discussed and an algorithm as well as an example
A New Heuristic for the Convex Quadratic Programming Problem
, 2015
"... This paper presents a new heuristic to linearise the convex quadratic programming problem. The usual KarushKuhnTucker conditions are used but in this case a linear objective function is also formulated from the set of linear equations and complementarity slackness conditions. An unboundedness cha ..."
Abstract
 Add to MetaCart
This paper presents a new heuristic to linearise the convex quadratic programming problem. The usual KarushKuhnTucker conditions are used but in this case a linear objective function is also formulated from the set of linear equations and complementarity slackness conditions. An un
Heuristic Algorithms for the Unconstrained Binary Quadratic Programming Problem
, 1998
"... In this paper we consider the unconstrained binary quadratic programming problem. This is the problem of maximising a quadratic objective by suitable choice of binary (zeroone) variables. We present two heuristic algorithms based upon tabu search and simulated annealing for this problem. Computatio ..."
Abstract

Cited by 42 (0 self)
 Add to MetaCart
In this paper we consider the unconstrained binary quadratic programming problem. This is the problem of maximising a quadratic objective by suitable choice of binary (zeroone) variables. We present two heuristic algorithms based upon tabu search and simulated annealing for this problem
Memetic Algorithms for the Unconstrained Binary Quadratic Programming Problem
 BioSystems
, 2004
"... This paper presents a memetic algorithm, a highly eective evolutionary algorithm incorporating local search for solving the unconstrained binary quadratic programming problem (BQP). To justify the approach, a tness landscape analysis is conducted experimentally for several instances of the BQP. ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
This paper presents a memetic algorithm, a highly eective evolutionary algorithm incorporating local search for solving the unconstrained binary quadratic programming problem (BQP). To justify the approach, a tness landscape analysis is conducted experimentally for several instances of the BQP
Consider the following convex quadratic programming problem
, 2013
"... Copyright © 2014 Ruopeng Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. In accordance of the Creative Commons Attributi ..."
Abstract
 Add to MetaCart
Attribution License all Copyrights © 2014 are reserved for SCIRP and the owner of the intellectual property Ruopeng Wang et al. All Copyright © 2014 are guarded by law and by SCIRP as a guardian. The present paper is devoted to a novel smoothing function method for convex quadratic programming problem
Results 1  10
of
2,959