Controlled perturbations for quadratically constrained quadratic programs
From MaRDI portal
Publication:4726047
DOI10.1007/BF02592062zbMath0616.90050OpenAlexW2081572357MaRDI QIDQ4726047
Shu-Cherng Fang, J. R. Rajasekera
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02592062
inequality constraintsnondifferentiabilityconvex quadratic function\(\epsilon \)- optimal primal solution\(\epsilon \)-optimal dual solutiondual perturbations
Convex programming (90C25) Quadratic programming (90C20) Duality theory (optimization) (49N15) Mathematical programming (90C99)
Related Items (7)
Controlled dual perturbations for posynomial programs ⋮ Quadratically constrained minimum cross-entropy analysis ⋮ A perturbation approach to the main duality theorem of quadratic geometric programming ⋮ Impproving the rate of convergence of the logarithmic barrier function method ⋮ Minimum cross-entropy analysis with entropy-type constraints ⋮ Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints ⋮ Minimum discrimination information problems via generalized geometric programming.
Cites Work
- A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems
- Quadratically constrained quadratic programming: Some applications and a method for solution
- Geometric Programming: Duality in Quadratic Programming and $l_p $-Approximation II (Canonical Programs)
- Unnamed Item
This page was built for publication: Controlled perturbations for quadratically constrained quadratic programs