The following pages link to (Q4323601):
Displayed 15 items.
- Exactness criteria for SDP-relaxations of quadratic extremum problems (Q508574) (← links)
- Space tensor conic programming (Q742309) (← links)
- Method of centers for minimizing generalized eigenvalues (Q1260783) (← links)
- A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix (Q1260789) (← links)
- On minimizing the largest eigenvalue of a symmetric matrix (Q1345514) (← links)
- Problems of distance geometry and convex properties of quadratic maps (Q1346137) (← links)
- An interior-point method for fractional programs with convex constraints (Q1804653) (← links)
- An interior-point method for multifractional programs with convex constraints (Q1893345) (← links)
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems (Q1919097) (← links)
- A primal-dual potential reduction method for problems involving matrix inequalities (Q1922696) (← links)
- Exact dual bounds for some nonconvex minimax quadratic optimization problems (Q2043977) (← links)
- Robust mean-squared error estimation of multiple signals in linear systems affected by model and noise uncertainties (Q2492687) (← links)
- Least-squares orthogonalization using semidefinite programming (Q2576234) (← links)
- Elementary Optimality Conditions for Nonlinear SDPs (Q2802534) (← links)
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting (Q5034932) (← links)