A generalized design approach to solution of the non-convex quadratic programming problem

DOI10.1016/0307-904X(87)90145-4MaRDI QIDQ1095032zbMATH OpenFDO

Authors John F. Brotchie

Publication date 1987

Published in Applied Mathematical Modelling (Search for Journal in Brave)

zbMATH Keywords

simulated annealingrobustnessMetropolis techniquenon-convex quadratic programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25)

Recommendations

• A global optimization approach for quadratic programs with nonconvex quadratic constraints
• scientific article; zbMATH DE number 1051015
• scientific article; zbMATH DE number 1130735
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• A novel optimization method for nonconvex quadratically constrained quadratic programs
• A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
• scientific article; zbMATH DE number 3848975
• scientific article; zbMATH DE number 4102819
• scientific article; zbMATH DE number 569957
• A generalized problem of quadratic programming

Cited in

(4)

• An infinite element theory
• A parallel heuristic for quadratic assignment problems
• Enhanced two-point diagonal quadratic approximation methods for design optimization
• A case of a linear quadratic optimal design with a weighting matrix which is not non-negative definite

This page was built for publication: A generalized design approach to solution of the non-convex quadratic programming problem

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