Global optimality conditions for fixed charge quadratic programs

DOI10.1007/S11590-018-1265-7MaRDI QIDQ1670551zbMATH OpenOpenAlexWikidataFDO

Authors 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

global optimality conditionsabstract convexity\(L\)-subgradientfixed charge quadratic programs

Mathematics Subject Classification ID

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

Recommendations

• A note on sufficient global optimality conditions for fixed charge quadratic programs
• Global optimality sufficient conditions for quadratic programming problem with inequality constraints
• scientific article; zbMATH DE number 7112360
• Global optimality conditions for mixed integer quadratic programming problems
• Global optimality conditions for quadratic \(0-1\) optimization problems
• Global optimality conditions and optimization methods for quadratic integer programming problems
• Global optimality conditions for quadratic optimization problems with binary constraints
• Global optimization of quadratic programming problems with quadratic constraints
• A sufficient conditions for global quadratic optimization
• Global optimality conditions for nonconvex minimization problems with quadratic constraints

Cites work

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

Cited in

(1)

• A note on sufficient global optimality conditions for fixed charge quadratic programs

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

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