Pages that link to "Item:Q1359045"

The following pages link to Global and local quadratic minimization (Q1359045):

Displaying 17 items.

• Large margin shortest path routing (Q694164) (← links)
• Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
• A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
• On the global optimization properties of finite-difference local descent algorithms (Q1207044) (← links)
• Note on a sufficient condition for a local minimum of a class of nonconvex quadratic programs (Q1290611) (← links)
• A monotonicity based approach to nonconvex quadratic minimization (Q1399081) (← links)
• Transformation of quasiconvex functions to eliminate local minima (Q1637350) (← links)
• Global minimization for problems with multiple local minima (Q1802424) (← links)
• Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs (Q1906278) (← links)
• Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← links)
• Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (Q2073059) (← links)
• New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
• Global optimization: local minima and transition points (Q2494285) (← links)
• (Q3035144) (← links)
• A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
• HYPER SENSITIVITY ANALYSIS OF PORTFOLIO OPTIMIZATION PROBLEMS (Q4650599) (← links)
• Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order (Q6632125) (← links)