Pages that link to "Item:Q1116888"

The following pages link to A parallel algorithm for constrained concave quadratic global minimization (Q1116888):

Displaying 29 items.

• Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
• A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837) (← links)
• A parallel algorithm for constrained concave quadratic global minimization (Q1116888) (← links)
• A computational analysis of LCP methods for bilinear and concave quadratic programming (Q1184453) (← links)
• A parallel stochastic method for solving linearly constrained concave global minimization problems (Q1200631) (← links)
• Sufficient conditions for solving linearly constrained separable concave global minimization problems (Q1207045) (← links)
• Parallel computing in nonconvex programming (Q1309859) (← links)
• New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints (Q1310977) (← links)
• A new technique for generating quadratic programming test problems (Q1315416) (← links)
• Global minimum potential energy conformations of small molecules (Q1319003) (← links)
• A quadratic assignment formulation of the molecular conformation problem (Q1319011) (← links)
• A parallel algorithm for linear programs with an additional reverse convex constraint (Q1376102) (← links)
• Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm (Q1779531) (← links)
• Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (Q1892595) (← links)
• A parallel algorithm for partially separable non-convex global minimization: Linear constraints (Q2276880) (← links)
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
• Sharp bounds for the maximum of the chi-square index in a class of contingency tables with given marginals (Q2563669) (← links)
• A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)
• Parallel computing in bound constrained quadratic programming (Q2718097) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
• Convex and concave relaxations of implicit functions (Q2943829) (← links)
• Performance of approximate algorithms for global minimization (Q3217953) (← links)
• A global minimization algorithm with parallel iterations (Q3481175) (← links)
• Guaranteed \(\epsilon\)-approximate solution for indefinite quadratic global minimization (Q3491318) (← links)
• An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions (Q3780011) (← links)
• A Parallel Algorithm for a Class of Convex Programs (Q3787794) (← links)
• A BLOCK-PARALLEL CONJUGATE GRADIENT METHOD FOR SEPARABLE QUADRATIC PROGRAMMING PROBLEMS^1 (Q4345058) (← links)
• (Q5315887) (← links)
• A parallel constrained efficient global optimization algorithm for expensive constrained optimization problems (Q6094299) (← links)