The following pages link to Samuel Burer (Q439917):
Displaying 45 items.
- Representing quadratically constrained quadratic programs as generalized copositive programs (Q439919) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- Relaxing the optimality conditions of box QP (Q538311) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound (Q839489) (← links)
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices (Q840651) (← links)
- Solving maximum-entropy sampling problems using factored masks (Q868455) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- Maximum stable set formulations and heuristics based on continuous optimization (Q1396818) (← links)
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization (Q1411644) (← links)
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs (Q1411645) (← links)
- Interior-point algorithms for semidefinite programming based on a nonlinear formulation (Q1610312) (← links)
- Quadratic programs with hollows (Q1659682) (← links)
- A branch-and-bound algorithm for instrumental variable quantile regression (Q1697970) (← links)
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides (Q1753067) (← links)
- Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming (Q1789641) (← links)
- Solving a class of semidefinite programs via nonlinear programming (Q1849262) (← links)
- Newsvendor games: convex optimization of centralized inventory operations (Q1939101) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- Three methods for robust grading (Q1991142) (← links)
- Quadratic optimization with switching variables: the convex hull for \(n=2\) (Q2044962) (← links)
- Convex hull representations for bounded products of variables (Q2046306) (← links)
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
- Correction to: ``Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs'' (Q2235166) (← links)
- A gentle, geometric introduction to copositive optimization (Q2349118) (← links)
- On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001) (← links)
- Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
- Coordinating the supply chain in the agricultural seed industry (Q2456431) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
- Local minima and convergence in low-rank semidefinite programming (Q2487849) (← links)
- The trust region subproblem with non-intersecting linear constraints (Q2515041) (← links)
- D.C. versus copositive bounds for standard QP (Q2583183) (← links)
- Computable representations for convex hulls of low-dimensional quadratic forms (Q2638365) (← links)
- Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow (Q2689820) (← links)
- A projected gradient algorithm for solving the maxcut SDP relaxation (Q2770188) (← links)
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs (Q2784422) (← links)
- A Two-Variable Approach to the Two-Trust-Region Subproblem (Q2796795) (← links)
- Copositive Programming (Q2802526) (← links)
- (Q2875385) (← links)
- The MILP Road to MIQCP (Q2897304) (← links)
- A semidefinite programming approach to the hypergraph minimum bisection problem (Q2996813) (← links)
- (Q3093393) (← links)
- A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs (Q3192093) (← links)
- A<i>p</i>-cone sequential relaxation procedure for 0-1 integer programs (Q3396384) (← links)
