Results 251 to 260 of about 184,320 (288)
Some of the next articles are maybe not open access.
Quadratic convex reformulations for a class of complex quadratic programming problems
Computational Optimization and ApplicationszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheng Lu 0007 +3 more
openaire +2 more sources
Reducing quadratic programming problem to regression problem: Stepwise algorithm
European Journal of Operational Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dong Qian Wang +2 more
openaire +1 more source
On the penalty approximation of quadratic programming problem
Kybernetika, 1991Summary: An upper bound for the difference of the exact solution of the problem of minimization of quadratic functional on a subspace and its penalty approximation has been given. The paper is supplied with a numerical example.
openaire +2 more sources
On Solvability of Convex Noncoercive Quadratic Programming Problems
Journal of Optimization Theory and Applications, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Sequential Quadratic Programming for Parameter Identification Problems
IFAC Proceedings Volumes, 1989Abstract Sequential quadratic programming (SQP) is a technique for nonlinear equality constrained minimization problems, which, from the point of view of local convergence, is equivalent to finding a root of the gradient of the Lagrangian by Newton's method, if the second order sufficient conditions hold. For general, unstructured, finite dimensional
D.M. Hwang, C.T. Kelley
openaire +1 more source
Quadratic programming and combinatorial minimum weight product problems
Mathematical Programming, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kern, Walter, Woeginger, Gerhard
openaire +5 more sources
A Dynamic-Programming Bound for the Quadratic Assignment Problem
1999The quadratic assignment problem (QAP) is the NP-complete optimization problem of assigning n facilities to n locations while minimizing certain costs. In practice, proving the optimality of a solution is hard even for moderate problem sizes with n ≅ 20. We present a new algorithm for solving the QAP.
Ambros Marzetta, Adrian Brüngger
openaire +1 more source
A Method for Solving the Indefinite Quadratic Programming Problem
Management Science, 1970A method is developed for obtaining a solution to the quadratic programming problem with an indefinite quadratic objective function. A search procedure using gradient projection is the core of the method. However at each step an alternate direction to gradient projection is proposed and two methods are given to continue after the revised gradient ...
openaire +1 more source
An Iterative Algorithm for Fuzzy Quadratic Programming Problems
2006This paper describes an interactive algorithm for fuzzy non linear programming problems. Based on some general results, an iterative algorithm is proposed, which modifies the admissible region in such a way as to increase at each step the global performance.
openaire +2 more sources
Construction of test problems in quadratic bivalent programming
ACM Transactions on Mathematical Software, 1991A method of constructing test problems for constrained bivalent quadratic programming is presented. For any feasible integer point for a given domain, the method generates quadratic functions whose minimum over the given domain occurs at the selected point.
openaire +1 more source