Controlled perturbations for quadratically constrained quadratic programs

DOI10.1007/BF02592062MaRDI QIDQ4726047zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

\(\epsilon \)- optimal primal solution\(\epsilon \)-optimal dual solutionconvex quadratic functiondual perturbationsinequality constraintsnondifferentiability

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Quadratic programming (90C20) Convex programming (90C25) Mathematical programming (90C99)

Recommendations

• Perturbing the dual feasible region for solving convex quadratic programs
• A canonical dual approach for solving linearly constrained quadratic programs
• An unconstrained convex programming approach to solving convex quadratic programming problems
• Application of the canonical dual transformation theory to a convex constrained quadratic programming
• Stability of linearly constrained convex quadratic programs

Cites work

• A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems
• Geometric Programming: Duality in Quadratic Programming and l_p -Approximation II (Canonical Programs)
• scientific article; zbMATH DE number 3363352 (Why is no real title available?)
• Quadratically constrained quadratic programming: Some applications and a method for solution

Cited in

(10)

• Controlled dual perturbations for posynomial programs
• Quadratically constrained minimum cross-entropy analysis
• Minimum cross-entropy analysis with entropy-type constraints
• Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints
• Controlled dual perturbations for central path trajectories in geometric programming
• Perturbing the dual feasible region for solving convex quadratic programs
• Minimum discrimination information problems via generalized geometric programming.
• Lexicographic perturbation for multiparametric linear programming with applications to control
• A perturbation approach to the main duality theorem of quadratic geometric programming
• Impproving the rate of convergence of the logarithmic barrier function method

This page was built for publication: Controlled perturbations for quadratically constrained quadratic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4726047)