Results 111 to 120 of about 1,126 (142)

A note on the strong polynomiality of convex quadratic programming

Mathematical Programming, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sung-Pil Hong, Sushil Verma
openaire   +2 more sources

An interior–exterior approach for convex quadratic programming

Applied Numerical Mathematics, 2012
The authors consider the following convex quadratic programming problem \[ \min\Biggl\{c^tx+{1\over 2} x^tQx: Ax= b,\,x\geq 0\Biggr\} \] and develop a polynomial time algorithm based on the use of mixed penalties methods. -- Some numerical results are given.
El Yassini, Khalid, El Haj Ben Ali, Safae   +1 more
openaire   +1 more source

Quadratic convex reformulations for a class of complex quadratic programming problems

Computational Optimization and Applications
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheng Lu 0007, Gaojian Kang, Guangtai Qu, Zhibin Deng   +3 more
openaire   +2 more sources

Semidefinite Programming Based Convex Relaxation for Nonconvex Quadratically Constrained Quadratic Programming

2019
In this paper, we review recent development in semidefinite programming (SDP) based convex relaxations for nonconvex quadratically constrained quadratic programming (QCQP) problems. QCQP problems have been well known as NP-hard nonconvex problems. We focus on convex relaxations of QCQP, which forms the base of global algorithms for solving QCQP.
Rujun Jiang, Duan Li 0002
openaire   +1 more source

Adaptive constraint reduction for convex quadratic programming

Computational Optimization and Applications, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jin Hyuk Jung, Dianne P. O'Leary, André L. Tits   +2 more
openaire   +1 more source

On convex and quadratic interval programming

Glasnik matematički, 1979
Existence 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

On convex quadratic programs with linear complementarity constraints

Computational Optimization and Applications, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lijie Bai, John E. Mitchell 0001, Jong-Shi Pang   +2 more
openaire   +2 more sources

Convex Quadratic Programming in Scheduling

2015
We consider the optimization problem of scheduling a given set of jobs on unrelated parallel machines with total weighted completion time objective. This is a classical scheduling problem known to be NP-hard since the 1970s. We give a new and simplified version of the currently best-known approximation algorithm, which dates back to 1998.
openaire   +1 more source

Identifying the optimal partition in convex quadratic programming

Operations Research Letters, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On Solvability of Convex Noncoercive Quadratic Programming Problems

Journal of Optimization Theory and Applications, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources