Global optimality conditions for fixed charge quadratic programs

DOI10.1007/s11590-018-1265-7zbMath1396.90057OpenAlexW2805420591WikidataQ129732463 ScholiaQ129732463MaRDI QIDQ1670551

Peng Zhang

Publication date: 5 September 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1265-7

zbMATH Keywords

abstract convexityglobal optimality conditions\(L\)-subgradientfixed charge quadratic programs

Mathematics Subject Classification ID

Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• A new local and global optimization method for mixed integer quadratic programming problems
• Sufficient global optimality conditions for bivalent quadratic optimization
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
• A note on sufficient global optimality conditions for fixed charge quadratic programs
• Global minimization of difference of quadratic and convex functions over box or binary constraints
• Box-constrained quadratic programs with fixed charge variables
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
• Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
• New optimality conditions for quadratic optimization problems with binary constraints
• Checking local optimality in constrained quadratic programming is NP- hard
• Capacitated facility location: Separation algorithms and computational experience
• A polyhedral study of nonconvex quadratic programs with box constraints
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
• Global optimality conditions for cubic minimization problem with box or binary constraints
• Global optimality conditions in nonconvex optimization
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
• Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
• Canonical Dual Solutions for Fixed Cost Quadratic Programs
• Global optimality conditions for mixed nonconvex quadratic programs†
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
• Abstract convexity and global optimization

This page was built for publication: Global optimality conditions for fixed charge quadratic programs