Pages that link to "Item:Q742305"
From MaRDI portal
The following pages link to Approximation methods for complex polynomial optimization (Q742305):
Displaying 13 items.
- Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
- Approximation algorithms for indefinite complex quadratic maximization problems (Q625875) (← links)
- Approximation algorithms for optimization of real-valued general conjugate complex forms (Q683722) (← links)
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
- Complex and quaternionic optimization (Q2061302) (← links)
- On decompositions and approximations of conjugate partial-symmetric tensors (Q2240646) (← links)
- Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations (Q2797107) (← links)
- (Q3337237) (← links)
- Constrained complex approximation algorithms in communication engineering (Q3978925) (← links)
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables (Q4637505) (← links)
- Unconstrained Optimization of Real Functions in Complex Variables (Q4899016) (← links)
- Approximation Methods for Polynomial Optimization (Q5390033) (← links)
- Logical Approaches to Computational Barriers (Q5898834) (← links)
