Pages that link to "Item:Q421783"
From MaRDI portal
The following pages link to Copositive optimization -- recent developments and applications (Q421783):
Displayed 49 items.
- Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
- On distributional robust probability functions and their computations (Q297175) (← links)
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- SPN graphs: when copositive = SPN (Q314749) (← links)
- Feasibility problems with complementarity constraints (Q320869) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- A variational approach of the rank function (Q356507) (← links)
- Testing copositivity with the help of difference-of-convex optimization (Q359631) (← links)
- Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems (Q380592) (← 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)
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition (Q415403) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- An improved algorithm to test copositivity (Q427387) (← 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)
- Copositivity and sparsity relations using spectral properties (Q504815) (← links)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- Exceptional family and solvability of copositive complementarity problems (Q662097) (← links)
- A polynomial-time interior-point method for circular cone programming based on kernel functions (Q747043) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- LP-based tractable subcones of the semidefinite plus nonnegative cone (Q1657406) (← 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)
- A MAX-CUT formulation of 0/1 programs (Q1785732) (← links)
- Building a completely positive factorization (Q1787912) (← links)
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258) (← links)
- Completely positive matrices: real, rational, and integral (Q1994053) (← links)
- On an extension of Pólya's Positivstellensatz (Q2342945) (← links)
- A gentle, geometric introduction to copositive optimization (Q2349118) (← links)
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme (Q2355798) (← links)
- Mathematical optimization ideas for biodiversity conservation (Q2356177) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
- Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems (Q2438409) (← links)
- A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints (Q2450736) (← links)
- New approximations for the cone of copositive matrices and its dual (Q2452380) (← links)
- Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
- Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations (Q2834695) (← links)
- SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) (← links)
- Necessary and sufficient conditions for copositive tensors (Q2938323) (← links)
- New results on the cp-rank and related properties of co(mpletely )positive matrices (Q2938346) (← links)
- (Q4568070) (← links)
- Extremal copositive matrices with minimal zero supports of cardinality two (Q4685505) (← links)
- A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors (Q4687245) (← links)
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
- Copositivity tests based on the linear complementarity problem (Q5963680) (← links)