scientific article; zbMATH DE number 724202
From MaRDI portal
Publication:4323601
Recommendations
Cited in
(20)- Method of centers for minimizing generalized eigenvalues
- A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix
- On minimizing the largest eigenvalue of a symmetric matrix
- Problems of distance geometry and convex properties of quadratic maps
- An interior-point method for approximate positive semidefinite completions
- An interior-point method for fractional programs with convex constraints
- An interior-point method for multifractional programs with convex constraints
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
- A primal-dual potential reduction method for problems involving matrix inequalities
- Exact dual bounds for some nonconvex minimax quadratic optimization problems
- Performance optimization over positive \(l_\infty\) cones
- Robust mean-squared error estimation of multiple signals in linear systems affected by model and noise uncertainties
- Least-squares orthogonalization using semidefinite programming
- New approaches for optimizing over the semimetric polytope
- Elementary optimality conditions for nonlinear SDPs
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting
- Exactness criteria for SDP-relaxations of quadratic extremum problems
- Semidefinite programming for discrete optimization and matrix completion problems
- Space tensor conic programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4323601)
