Pages that link to "Item:Q3778558"

The following pages link to Some NP-complete problems in quadratic and nonlinear programming (Q3778558):

Displaying 50 items.

• On monotonicity and search strategies in face-based copositivity detection algorithms (Q2155140) (← links)
• Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives (Q2156386) (← links)
• On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices (Q2158273) (← links)
• Immobile indices and CQ-free optimality criteria for linear copositive programming problems (Q2174923) (← links)
• A survey of hidden convex optimization (Q2176821) (← links)
• Data science applications to string theory (Q2187812) (← links)
• On the complexity of detecting convexity over a box (Q2191776) (← links)
• A study of piecewise linear-quadratic programs (Q2194127) (← links)
• Hermitian completely positive matrices (Q2197205) (← links)
• Lower bounds for finding stationary points I (Q2205972) (← links)
• On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
• Testing copositivity via mixed-integer linear programming (Q2226458) (← links)
• Exploiting partial correlations in distributionally robust optimization (Q2227536) (← links)
• Globally solving extended trust region subproblems with two intersecting cuts (Q2228371) (← links)
• Two methods for the maximization of homogeneous polynomials over the simplex (Q2231046) (← links)
• Optimality conditions for maximizing a function over a polyhedron (Q2248749) (← links)
• Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations (Q2274881) (← links)
• On the solution of concave knapsack problems (Q2276878) (← links)
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
• On types of degenerate critical points of real polynomial functions (Q2284966) (← links)
• Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
• A semidefinite relaxation algorithm for checking completely positive separable matrices (Q2313773) (← links)
• \(Z\)-eigenvalues based structured tensors: \(\mathcal{M}_Z\)-tensors and strong \(\mathcal{M}_Z\)-tensors (Q2326368) (← links)
• Optimality and stability of symmetric evolutionary games with applications in genetic selection (Q2339916) (← links)
• Narrowing the difficulty gap for the Celis-Dennis-Tapia problem (Q2349132) (← links)
• Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
• Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme (Q2355798) (← links)
• Methods for convex and general quadratic programming (Q2356335) (← links)
• Feature extraction algorithms for constrained global optimization. II: Batch process scheduling application (Q2368103) (← links)
• Inverse problems from biomedicine: inference of putative disease mechanisms and robust therapeutic strategies (Q2376849) (← links)
• Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
• Embedded variable selection method using signomial classification (Q2400010) (← links)
• Scheduling for a processor sharing system with linear slowdown (Q2408895) (← links)
• A new certificate for copositivity (Q2418975) (← links)
• A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
• Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior (Q2420824) (← links)
• Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
• First-order methods almost always avoid strict saddle points (Q2425175) (← links)
• Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
• Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
• On the exhaustivity of simplicial partitioning (Q2442641) (← links)
• A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints (Q2450736) (← links)
• The bounds of feasible space on constrained nonconvex quadratic programming (Q2469621) (← links)
• Algorithmic copositivity detection by simplicial partition (Q2477530) (← links)
• A multiple penalty function method for solving max-bisection problems (Q2489432) (← links)
• Block pivoting and shortcut strategies for detecting copositivity (Q2564929) (← links)
• The copositive completion problem (Q2568369) (← links)
• Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)
• A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)
• A new class of improved convex underestimators for twice continuously differentiable constrained NLPs (Q2574101) (← links)