The following pages link to Mirjam Dür (Q172144):
Displaying 36 items.
- SPN completable graphs (Q269250) (← links)
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) (← links)
- A copositive formulation for the stability number of infinite graphs (Q344928) (← links)
- Testing copositivity with the help of difference-of-convex optimization (Q359631) (← links)
- Scaling relationship between the copositive cone and Parrilo's first level approximation (Q395830) (← links)
- An improved algorithm to test copositivity (Q427387) (← links)
- Probabilistic subproblem selection in branch-and-bound algorithms (Q557739) (← links)
- A class of problems where dual bounds beat underestimation bounds (Q598587) (← links)
- (Q813357) (redirect page) (← links)
- Matching stochastic algorithms to objective function landscapes (Q813359) (← links)
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices (Q840651) (← links)
- First order solutions in conic programming (Q890175) (← links)
- Copositive Lyapunov functions for switched systems over cones (Q1015029) (← links)
- Packing solar cells on a roof (Q1041385) (← links)
- Lagrange duality and partitioning techniques in nonconvex global optimization (Q1372558) (← links)
- Necessary and sufficient global optimality conditions for convex maximization revisited (Q1378644) (← links)
- A parametric characterization of local optimality (Q1395148) (← links)
- Conditions characterizing minima of the difference of functions (Q1598193) (← links)
- A factorization method for completely positive matrices (Q2174498) (← links)
- Copositive programming via semi-infinite optimization (Q2435031) (← links)
- Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
- Solving fractional problems with dynamic multistart improving hit-and-run (Q2468758) (← links)
- Algorithmic copositivity detection by simplicial partition (Q2477530) (← links)
- Irreducible elements of the copositive cone (Q2637144) (← links)
- Solving sum-of-ratios fractional programs using efficient points (Q2743661) (← links)
- Genericity Results in Linear Conic Programming—A Tour d’Horizon (Q2976141) (← links)
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique (Q3093056) (← links)
- Open problems in the theory of completely positive and copositive matrices (Q3448166) (← links)
- (Q3497912) (← links)
- Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices (Q4902917) (← links)
- (Q5146244) (← links)
- An Adaptive Linear Approximation Algorithm for Copositive Programs (Q5189550) (← links)
- On copositive programming and standard quadratic optimization problems (Q5929997) (← links)
- Dual bounding procedures lead to convergent branch-and-bound algorithms (Q5955564) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
- Obituary for Georg J. Still (13 November 1951–15 December 2023) (Q6618204) (← links)
