Pages that link to "Item:Q687094"

The following pages link to Approximation algorithms for indefinite quadratic programming (Q687094):

Displaying 34 items.

• Global solutions to folded concave penalized nonconvex learning (Q282459) (← links)
• An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230) (← links)
• Trading performance for stability in Markov decision processes (Q340568) (← links)
• An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
• On mutual concavity and strategically-zero-sum bimatrix games (Q428856) (← links)
• Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
• An FPTAS for minimizing the product of two non-negative linear cost functions (Q623370) (← links)
• New formulations of the multiple sequence alignment problem (Q628651) (← links)
• Complexity bounds for second-order optimality in unconstrained optimization (Q657654) (← links)
• Approximation algorithms for indefinite quadratic programming (Q687094) (← links)
• Open questions in complexity theory for numerical optimization (Q687097) (← links)
• Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
• A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
• Games of fixed rank: a hierarchy of bimatrix games (Q847799) (← links)
• A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
• A better differential approximation ratio for symmetric TSP (Q924134) (← links)
• Quadratic programming and combinatorial minimum weight product problems (Q985315) (← links)
• Separable and low-rank continuous games (Q999116) (← links)
• Complexity results for some global optimization problems (Q1024247) (← links)
• Optimization of a convex program with a polynomial perturbation (Q1043242) (← links)
• Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
• New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
• On approximation algorithms for concave mixed-integer quadratic programming (Q1800986) (← links)
• Differential approximation results for the traveling salesman problem with distances 1 and 2 (Q1869490) (← links)
• A trust-region strategy for minimization on arbitrary domains (Q1890927) (← links)
• A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
• The complexity of approximating a nonlinear program (Q1906280) (← links)
• Approximation algorithm for a class of global optimization problems (Q1937958) (← links)
• Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
• Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution (Q2424763) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
• A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (Q5084603) (← links)
• An approximation algorithm for indefinite mixed integer quadratic programming (Q6165586) (← links)
• An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)