The optimal solution set of non-convex quadratic minimization problem over a D.C. set

zbMATH Open1141.49317MaRDI QIDQ5455723FDOQ5455723

Authors: Huiling Lin, Shenggui Zhang 

Publication date: 4 April 2008

Recommendations

• Characterizations of optimal solution sets for DC optimization problems in locally convex spaces
• DC approach to weakly convex optimization and nonconvex quadratic optimization problems
• Optimality conditions in the problem of maximization of the difference of two convex functions
• A finite algorithm for a particular D.C. quadratic programming problem
• On the solution set of convex problems and its numerical application

zbMATH Keywords

Lagrange dualityglobal optimality conditionD.C. programmingnon-convex quadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Numerical methods involving duality (49M29)

Cited In (2)

• Characterizations of optimal solution sets for DC optimization problems in locally convex spaces
• DC approach to weakly convex optimization and nonconvex quadratic optimization problems

This page was built for publication: The optimal solution set of non-convex quadratic minimization problem over a D.C. set

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