Pages that link to "Item:Q625875"
From MaRDI portal
The following pages link to Approximation algorithms for indefinite complex quadratic maximization problems (Q625875):
Displayed 8 items.
- Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
- Approximation algorithms for optimization of real-valued general conjugate complex forms (Q683722) (← links)
- Approximation methods for complex polynomial optimization (Q742305) (← links)
- Partially positive matrices (Q892772) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- On decompositions and approximations of conjugate partial-symmetric tensors (Q2240646) (← links)
- An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels (Q5746701) (← links)
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)