Global minimization of difference of quadratic and convex functions over box or binary constraints
type: Item
instance of: scholarly article
title: Global minimization of difference of quadratic and convex functions over box or binary constraints
zbMATH Open document ID: 1161.90465
published in: Optimization Letters
publication date: 2008-06-11T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 5286559
zbMATH Keywords: quadratic non-convex minimization
zbMATH Keywords: concave minimization
zbMATH Keywords: necessary optimality conditions
zbMATH Keywords: sufficient conditions
zbMATH Keywords: box constraints
zbMATH Keywords: 0/1 constraints
author: V. Jeyakumar
author: Nguyen Quang Huy
MaRDI profile type: Publication
full work available at URL: s11590-007-0053-6
OpenAlex ID: W1968742153
cites work: A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
cites work: Computational experience with a new class of convex underestimators: Box-constrained NLP problems
cites work: A continuous approch for globally solving linearly constrained quadratic
cites work: Global optimality conditions for quadratic optimization problems with binary constraints
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: A note on diagonally dominant matrices
cites work: Necessary and sufficient global optimality conditions for convex maximization revisited
cites work: Optimization in computational chemistry and molecular biology. Local and global approaches. Conference, Princeton Univ., Princeton, NJ, USA, May 7--9, 1999
cites work: Q4833806
cites work: Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
cites work: Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints
cites work: CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
cites work: Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
cites work: Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
cites work: Nonconvex piecewise-quadratic underestimation for global minimization
cites work: Iterative convex quadratic approximation for global optimization in protein docking
cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming
cites work: Sufficient global optimality conditions for bivalent quadratic optimization
DOI: 10.1007/S11590-007-0053-6
description: scientific article; zbMATH DE number 5286559