Pages that link to "Item:Q4127644"

The following pages link to Maximization of A convex quadratic function under linear constraints (Q4127644):

Displaying 35 items.

• The bipartite quadratic assignment problem and extensions (Q322542) (← links)
• On the global minimization of concave functions (Q800693) (← links)
• Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
• Jointly constrained bilinear programs and related problems: An overview (Q918873) (← links)
• A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
• On the nonlinear multilevel programming problems (Q998684) (← links)
• Convergence of a subgradient method for computing the bound norm of matrices (Q1057619) (← links)
• A finite procedure to generate feasible points for the extreme point mathematical programming problem (Q1103529) (← links)
• A computational analysis of LCP methods for bilinear and concave quadratic programming (Q1184453) (← links)
• Efficient algorithms for solving rank two and rank three bilinear programming problems (Q1186269) (← links)
• Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
• A new reformulation-linearization technique for bilinear programming problems (Q1201905) (← links)
• Linear multiplicative programming (Q1207311) (← links)
• On the solution and complexity of a generalized linear complementarity problem (Q1327430) (← links)
• A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
• Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis (Q1728217) (← links)
• Generation of disjointly constrained bilinear programming test problems (Q1803651) (← links)
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints (Q1977647) (← links)
• A new algorithm for concave quadratic programming (Q2010088) (← links)
• Quadratic maximization of reachable values of affine systems with diagonalizable matrix (Q2032024) (← links)
• A note on adapting methods for continuous global optimization to the discrete case (Q2276877) (← links)
• The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
• A weighting method for 0-1 indefinite quadratic bilevel programming (Q2359528) (← links)
• Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141) (← links)
• A decomposition approach for global optimum search in QP, NLP and MINLP problems (Q2638940) (← links)
• Global minimization of large-scale constrained concave quadratic problems by separable programming (Q3731373) (← links)
• Optimal design of FIR linear phase digital filters via convex quadratic programming method (Q3795590) (← links)
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts (Q3877412) (← links)
• Novel approaches to the discrimination problem (Q4031377) (← links)
• A cutting plane algorithm for solving bilinear programs (Q4124613) (← links)
• Introduction to QUBO (Q5050141) (← links)
• The Bipartite QUBO (Q5050150) (← links)
• Optimal input design for system identification using spectral decomposition (Q5221395) (← links)