Pages that link to "Item:Q1177910"

The following pages link to Quadratic programming with one negative eigenvalue is NP-hard (Q1177910):

Displaying 50 items.

• A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
• Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
• On approximation algorithms for concave mixed-integer quadratic programming (Q1800986) (← links)
• A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
• Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs (Q1906278) (← links)
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
• An exact algorithm for graph partitioning (Q1942271) (← links)
• On topology optimization and canonical duality method (Q1986619) (← links)
• A new algorithm for concave quadratic programming (Q2010088) (← links)
• Computation of the output of a function with fuzzy inputs based on a low-rank tensor approximation (Q2013835) (← links)
• Conic approximation to nonconvex quadratic programming with convex quadratic constraints (Q2018510) (← links)
• The exact solution of multiparametric quadratically constrained quadratic programming problems (Q2022221) (← links)
• Linear interval parametric approach to testing pseudoconvexity (Q2022238) (← links)
• Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems (Q2044489) (← links)
• A new polynomially solvable class of quadratic optimization problems with box constraints (Q2047220) (← links)
• Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (Q2073059) (← links)
• On the complexity of finding a local minimizer of a quadratic function over a polytope (Q2089789) (← links)
• Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
• A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues (Q2112679) (← links)
• Derivative-free trust region optimization for robust well control under geological uncertainty (Q2130973) (← links)
• Role of sparsity and structure in the optimization landscape of non-convex matrix sensing (Q2133410) (← links)
• On tail dependence matrices. The realization problem for parametric families (Q2191424) (← links)
• A study of piecewise linear-quadratic programs (Q2194127) (← links)
• Smoothed amplitude flow-based phase retrieval algorithm (Q2230851) (← links)
• A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
• A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables (Q2255939) (← links)
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
• Range assignment of base-stations maximizing coverage area without interference (Q2283033) (← links)
• Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (Q2297658) (← links)
• On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
• The clique problem for graphs with a few eigenvalues of the same sign (Q2355311) (← links)
• Methods for convex and general quadratic programming (Q2356335) (← links)
• Regularized robust optimization: the optimal portfolio execution case (Q2376119) (← links)
• Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (Q2423782) (← links)
• Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution (Q2424763) (← links)
• Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
• Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems (Q2438409) (← links)
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
• \(NP\)-hardness of linear multiplicative programming and related problems (Q2564608) (← links)
• On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs (Q2633284) (← links)
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
• Multi-market portfolio optimization with conditional value at risk (Q2670592) (← links)
• A computational study on QP problems with general linear constraints (Q2673522) (← links)
• Global optimization for non-convex programs via convex proximal point method (Q2691402) (← links)
• A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs (Q2835666) (← links)
• Topographic Mapping of Large Dissimilarity Data Sets (Q3164213) (← links)
• On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487) (← links)
• Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization (Q3565467) (← links)
• Minimizing the sum of a convex function and a specially structured nonconvex function (Q3835636) (← links)
• Strongly polynomial algorithm for a production-transportation problem with concave production cost (Q3835663) (← links)