Unified global optimality conditions for smooth minimization problems with mixed variables
From MaRDI portal
Publication:3598042
DOI10.1051/ro:2008019zbMath1153.90544OpenAlexW2131185838MaRDI QIDQ3598042
Nguyen Quang Huy, S. Srisatkunarajah, Vaithilingam Jeyakumar
Publication date: 29 January 2009
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/105407
difference of convex functionsglobal optimizationoptimality conditionsbox constraintsnonconvex optimizationquadratic minimizationdiscrete constraints
Related Items
Cites Work
- Unnamed Item
- Sufficient global optimality conditions for bivalent quadratic optimization
- Global minimization of difference of quadratic and convex functions over box or binary constraints
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
- 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
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- Iterative convex quadratic approximation for global optimization in protein docking
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints
- On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball
