Pages that link to "Item:Q1812072"

The following pages link to Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming (Q1812072):

Displaying 50 items.

• Two-stage stochastic standard quadratic optimization (Q2077956) (← links)
• Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere (Q2080815) (← links)
• A study on sequential minimal optimization methods for standard quadratic problems (Q2095525) (← links)
• A note on completely positive relaxations of quadratic problems in a multiobjective framework (Q2114601) (← links)
• On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
• Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
• On monotonicity and search strategies in face-based copositivity detection algorithms (Q2155140) (← links)
• Testing copositivity via mixed-integer linear programming (Q2226458) (← links)
• Exploiting partial correlations in distributionally robust optimization (Q2227536) (← links)
• On sparsity of the solution to a random quadratic optimization problem (Q2227539) (← links)
• Two methods for the maximization of homogeneous polynomials over the simplex (Q2231046) (← links)
• Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
• Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) (← links)
• Rounding on the standard simplex: regular grids for global optimization (Q2250080) (← links)
• Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations (Q2274881) (← links)
• Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices (Q2301196) (← links)
• Completely positive reformulations for polynomial optimization (Q2349130) (← links)
• An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (Q2349131) (← links)
• Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme (Q2355798) (← links)
• Mathematical optimization ideas for biodiversity conservation (Q2356177) (← links)
• Tightening a copositive relaxation for standard quadratic optimization problems (Q2376121) (← links)
• Multi-standard quadratic optimization: Interior point methods and cone programming reformulation (Q2379693) (← links)
• On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001) (← links)
• Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
• A new certificate for copositivity (Q2418975) (← links)
• Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior (Q2420824) (← links)
• Copositive programming via semi-infinite optimization (Q2435031) (← links)
• Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
• New approximations for the cone of copositive matrices and its dual (Q2452380) (← links)
• Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball (Q2458903) (← links)
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
• A PTAS for the minimization of polynomials of fixed degree over the simplex (Q2503350) (← links)
• D.C. versus copositive bounds for standard QP (Q2583183) (← links)
• Computable representations for convex hulls of low-dimensional quadratic forms (Q2638365) (← links)
• Interplay of non-convex quadratically constrained problems with adjustable robust optimization (Q2661757) (← links)
• New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
• (Q2725640) (← links)
• Copositive Programming (Q2802526) (← links)
• On the accuracy of uniform polyhedral approximations of the copositive cone (Q2885468) (← links)
• The cubic spherical optimization problems (Q2894517) (← links)
• The fundamental theorem of linear programming: extensions and applications (Q2996803) (← links)
• On LP-based approximation for copositive formulation of stable set problem (Q3121395) (← links)
• Robust Quadratic Programming with Mixed-Integer Uncertainty (Q3386756) (← links)
• Improved Conic Reformulations for $K$-means Clustering (Q4555446) (← links)
• A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
• Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls (Q4971384) (← links)
• Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization (Q4991677) (← links)
• Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (Q5072588) (← links)
• An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
• A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems (Q5110556) (← links)