Pages that link to "Item:Q2010088"

The following pages link to A new algorithm for concave quadratic programming (Q2010088):

Displaying 16 items.

• On the relation between concavity cuts and the surrogate dual for convex maximization problems (Q427376) (← links)
• A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings (Q710681) (← links)
• Algorithms for bound constrained quadratic programming problems (Q1122320) (← links)
• New theoretical results on recursive quadratic programming algorithms (Q1265011) (← links)
• A new algorithm for solving the general quadratic programming problem (Q1908926) (← links)
• A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues (Q2112679) (← links)
• New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
• A new algorithm for quadratic integer programming problems with cardinality constraint (Q2174794) (← links)
• Maximization of a PSD quadratic form and factorization (Q2230781) (← links)
• Robustness of Farrell cost efficiency measurement under data perturbations: evidence from a US manufacturing application (Q2239903) (← links)
• New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
• An Algorithm for Unconstrained Quadratically Penalized Convex Optimization (Q3087581) (← links)
• An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i>^3.5<i>L</i>) Arithmetic Operations (Q3200887) (← links)
• (Q3837121) (← links)
• (Q5399378) (← links)
• A generalized robust data envelopment analysis model based on directional distance function (Q6096583) (← links)