Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints

DOI10.1007/S10957-007-9177-1MaRDI QIDQ2471081zbMATH OpenOpenAlexFDO

Authors Zhiyou Wu, V. Jeyakumar, A. M. Rubinov

Publication date 18 February 2008

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10957-007-9177-1

zbMATH Keywords

Binary constraintsGlobal optimalityQuadratic inequality constraintsQuadratic optimizationSufficient conditions

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26)

Recommendations

• On sufficient global optimality conditions for bivalent quadratic programs with quadratic constraints
• Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
• CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
• Sufficient global optimality conditions for bivalent quadratic optimization
• New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problems

Cites work

• Abstract convexity and global optimization
• Conditions for global optimality. II
• Global optimality conditions for nonconvex optimization
• Global optimality conditions for quadratic optimization problems with binary constraints
• Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
• scientific article; zbMATH DE number 994348 (Why is no real title available?)
• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
• Sufficient global optimality conditions for bivalent quadratic optimization
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints

Cited in

(20)

• New Kuhn-Tucker sufficiency for global optimality via convexification
• Optimality conditions and optimization methods for quartic polynomial optimization
• Global optimality conditions for fixed charge quadratic programs
• D.C. programming approach for solving an applied ore-processing problem
• Global sufficient optimality conditions for a special cubic minimization problem
• Global optimality conditions for cubic minimization problem with box or binary constraints
• Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
• New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problems
• Sufficient global optimality conditions for weakly convex minimization problems
• On sufficient global optimality conditions for bivalent quadratic programs with quadratic constraints
• Global optimality sufficient conditions for quadratic programming problem with inequality constraints
• Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators
• Unified global optimality conditions for smooth minimization problems with mixed variables
• Global optimality conditions for mixed nonconvex quadratic programs†
• Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
• On zero duality gap in nonconvex quadratic programming problems
• Sufficient global optimality conditions for bivalent quadratic optimization
• A note on sufficient global optimality conditions for fixed charge quadratic programs
• Global optimality conditions for cubic minimization problems with cubic constraints
• Global optimality conditions for some classes of optimization problems

This page was built for publication: Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints

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