Pages that link to "Item:Q3200891"

The following pages link to Polynomial time algorithms for some classes of constrained nonconvex quadratic problems (Q3200891):

Displaying 25 items.

• An outer approximation method for minimizing the product of several convex functions on a convex set (Q686993) (← links)
• An algorithm for solving convex programs with an additional convex- concave constraint (Q689151) (← links)
• A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
• An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
• A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
• Branch-and-reduce algorithm for convex programs with additional multiplicative constraints (Q1042085) (← links)
• Quadratic programming with one negative eigenvalue is NP-hard (Q1177910) (← links)
• Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
• A finite algorithm for solving general quadratic problems (Q1315437) (← links)
• Global minimization of a generalized convex multiplicative function (Q1315440) (← links)
• Bilinear separation of two sets in \(n\)-space (Q1315445) (← links)
• Strongly polynomial time algorithms for certain concave minimization problems on networks (Q1317011) (← links)
• Using copositivity for global optimality criteria in concave quadratic programming problems (Q1319026) (← links)
• Convex programs with an additional constraint on the product of several convex functions (Q1333464) (← links)
• Outcome-space cutting-plane algorithm for linear multiplicative programming (Q1579657) (← links)
• Algorithms for approximate linear regression design with application to a first order model with heteroscedasticity (Q1621395) (← links)
• A global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645) (← links)
• Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions (Q1804585) (← links)
• On the use of optimization models for portfolio selection: A review and some computational results (Q1890889) (← links)
• A branch-and-reduce approach to global optimization (Q1924068) (← links)
• Global optimization method for linear multiplicative programming (Q2355349) (← links)
• A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
• \(NP\)-hardness of linear multiplicative programming and related problems (Q2564608) (← links)
• Active fault diagnosis for linear stochastic systems subject to chance constraints (Q6136140) (← links)
• An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)