Results 131 to 140 of about 3,006 (163)

A STUDY ON SENSITIVITY ANALYSIS FOR CONVEX QUADRATIC PROGRAMS

Asia-Pacific Journal of Operational Research, 2006
We extend the two similar interior-point approaches to sensitivity analysis originally developed for linear programs to those for convex quadratic programs, where the first approach is the ∊-sensitivity analysis and the other is Yildirim and Todd's. We study the relationship between the bounds on perturbation of the input parameters arising from the ...
openaire   +2 more sources

A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs

SIAM Journal on Numerical Analysis, 1991
The 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

An Efficient Algorithm for Solving Convex–Convex Quadratic Fractional Programs

Journal of Optimization Theory and Applications, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yamamoto, R., Konno, H.
openaire   +2 more sources

Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints

Optimization Letters, 2013
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

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