Results 211 to 220 of about 40,565 (244)
Some of the next articles are maybe not open access.
Solving quadratic assignment problems using convex quadratic programming relaxations
Optimization Methods and Software, 2001We describe a branch-and-bound algorithm for the quadratic assignment problem (QAP) that uses a convex quadratic programming (QP) relaxation to obtain a bound at each node. The QP subproblems are approximately solved using the Frank-Wolfe algorithm, which in this case requires the solution of a linear assignment problem on each iteration. Our branching
Kurt M. Anstreicher, Nathan W. Brixius
openaire +1 more source
Large Scale Convex Quadratic Programming.
1975PhD ; Operations research ; University of Michigan, Horace H. Rackham School of Graduate Studies ; http://deepblue.lib.umich.edu/bitstream/2027.42/189077/2/7609400 ...
openaire +2 more sources
A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
SIAM Journal on Optimization, 1991Summary: An interior point method for quadratically constrained convex quadratic programming is presented that is based on a logarithmic barrier function approach and terminates at a required accuracy of an approximate solution in polynomial time. This approach generates a sequence of unconstrained optimization problems, each of which is approximately ...
Goldfarb, Donald +2 more
openaire +2 more sources
Quadratic convex reformulation for quadratic programming with linear on–off constraints
European Journal of Operational Research, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baiyi Wu, Duan Li, Rujun Jiang
openaire +2 more sources
A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
SIAM Journal on Numerical Analysis, 1991The authors consider maximizing a concave quadratic function under convex quadratic constraints: an interior point method is developed. Complexity results are provided.
Mehrotra, S., Sun, Jie
openaire +2 more sources
Stability in convex quadratic parametric programming
Mathematische Operationsforschung und Statistik, 1976In this paper we discuss convex quadratic programming problems with variable coefficients in the linear part of the objective function or/and in the right hand side of the constraints. Local and global stability statements are contained. An important global stability theorem is proved for a feneral non-linear programming problem arbitrary, where F is a
openaire +2 more sources
Conic approximation to nonconvex quadratic programming with convex quadratic constraints
Journal of Global Optimization, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deng, Zhibin +3 more
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
On convex and quadratic interval programming
Glasnik matematički, 1979Existence of solution for certain class of convex interval programming problems is proved. In special case of quadratic problems a new numerical method is proposed.
Limić, Nedžad, Tutek, Zvonimir
openaire +2 more sources
Simplicial decomposition for large-scale quadratic convex programming
2017We consider the following problem min f(x) = x>Qx + c>x + d s.t. Ax = b (1) x = 0 with Q ?Rn×n, c ?Rn, d ?R, A ?Rm×n and b ?Rm. When the size of the problem is large, very often it is more convenient to take advantage of smart or ad-hoc strategies to tackle the problem.
Bettiol E. +3 more
openaire +3 more sources