Unified global optimality conditions for smooth minimization problems with mixed variables

DOI10.1051/RO:2008019MaRDI QIDQ3598042zbMATH OpenOpenAlexFDO

Authors S. Srisatkunarajah, Nguyen Quang Huy, V. 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, https://semanticscholar.org/paper/37092c875d083fcffbf14b6a28a834f0d748278c

zbMATH Keywords

global optimizationnonconvex optimizationbox constraintsoptimality conditionsquadratic minimizationdifference of convex functionsdiscrete constraints

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30)

Recommendations

• Global optimality conditions for mixed integer nonlinear programming problems
• Global optimality conditions for mixed integer quadratic programming problems
• Global optimality conditions for some classes of optimization problems
• Global optimality conditions for mixed nonconvex quadratic programs†
• Distinguishing a global minimizer from local minimizers of quadratic minimization with mixed variables

Cites work

• scientific article; zbMATH DE number 1057696 (Why is no real title available?)
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Global minimization of difference of quadratic and convex functions over box or binary constraints
• Global optimality conditions for quadratic optimization problems with binary constraints
• Iterative convex quadratic approximation for global optimization in protein docking
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
• On semidefinite bounds for maximization of a non-convex quadratic objective over thel₁unit ball
• Optimization in computational chemistry and molecular biology. Local and global approaches. Conference, Princeton Univ., Princeton, NJ, USA, May 7--9, 1999
• Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
• 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 multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints

Cited in

(2)

• Distinguishing a global minimizer from local minimizers of quadratic minimization with mixed variables
• Sufficient conditions for global optimality of semidefinite optimization

This page was built for publication: Unified global optimality conditions for smooth minimization problems with mixed variables

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