The following pages link to Copositive Programming (Q2802526):
Displaying 41 items.
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Moment approximations for set-semidefinite polynomials (Q382904) (← links)
- From seven to eleven: completely positive matrices with high cp-rank (Q401186) (← links)
- Copositivity and constrained fractional quadratic problems (Q403649) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Representing quadratically constrained quadratic programs as generalized copositive programs (Q439919) (← links)
- On the computational complexity of membership problems for the completely positive cone and its dual (Q461444) (← links)
- The structure of completely positive matrices according to their CP-rank and CP-plus-rank (Q492774) (← links)
- Modularity maximization using completely positive programming (Q1620447) (← links)
- Completely positive reformulations of polynomial optimization problems with linear constraints (Q1679621) (← links)
- A fresh CP look at mixed-binary QPs: new formulations and relaxations (Q1683686) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
- A MAX-CUT formulation of 0/1 programs (Q1785732) (← links)
- Building a completely positive factorization (Q1787912) (← links)
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming (Q1789641) (← links)
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258) (← links)
- On sufficient properties of sufficient matrices (Q2051181) (← links)
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
- Two-stage stochastic standard quadratic optimization (Q2077956) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- Hermitian completely positive matrices (Q2197205) (← links)
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices (Q2301196) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- A gentle, geometric introduction to copositive optimization (Q2349118) (← links)
- A new certificate for copositivity (Q2418975) (← links)
- New approximations for the cone of copositive matrices and its dual (Q2452380) (← links)
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization (Q2661757) (← links)
- SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) (← links)
- New results on the cp-rank and related properties of co(mpletely )positive matrices (Q2938346) (← links)
- Genericity Results in Linear Conic Programming—A Tour d’Horizon (Q2976141) (← links)
- Robust Quadratic Programming with Mixed-Integer Uncertainty (Q3386756) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- Profit Sharing Agreements in Decentralized Supply Chains: A Distributionally Robust Approach (Q4969339) (← links)
- Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming (Q5058050) (← links)
- Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
- Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization (Q6166103) (← links)
- A copositive framework for analysis of hybrid Ising-classical algorithms (Q6495776) (← links)
