Global minimization of difference of quadratic and convex functions over box or binary constraints

DOI10.1007/s11590-007-0053-6zbMath1161.90465OpenAlexW1968742153MaRDI QIDQ928298

Vaithilingam Jeyakumar, Nguyen Quang Huy

Publication date: 11 June 2008

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

Full work available at URL: https://doi.org/10.1007/s11590-007-0053-6

zbMATH Keywords

concave minimizationnecessary optimality conditionsbox constraintssufficient conditions0/1 constraintsquadratic non-convex minimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items (8)

Global optimality conditions for nonconvex minimization problems with quadratic constraints ⋮ Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems ⋮ Global optimality conditions for fixed charge quadratic programs ⋮ Optimality Conditions for the Minimization of Quadratic 0-1 Problems ⋮ Global optimality conditions for cubic minimization problems with cubic constraints ⋮ Optimization methods for mixed integer weakly concave programming problems ⋮ Global optimality conditions for quadratic \(0-1\) optimization problems ⋮ Unified global optimality conditions for smooth minimization problems with mixed variables

Cites Work

• Unnamed Item
• Sufficient global optimality conditions for bivalent quadratic optimization
• Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
• Necessary and sufficient global optimality conditions for convex maximization revisited
• A note on diagonally dominant matrices
• Computational experience with a new class of convex underestimators: Box-constrained NLP problems
• Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
• Optimization in computational chemistry and molecular biology. Local and global approaches. Conference, Princeton Univ., Princeton, NJ, USA, May 7--9, 1999
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
• Iterative convex quadratic approximation for global optimization in protein docking
• Nonconvex piecewise-quadratic underestimation for global minimization
• A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Lectures on Modern Convex Optimization
• A continuous approch for globally solving linearly constrained quadratic
• Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints
• CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS

This page was built for publication: Global minimization of difference of quadratic and convex functions over box or binary constraints