Pages that link to "Item:Q3683922"
From MaRDI portal
The following pages link to Semi-Definite Matrix Constraints in Optimization (Q3683922):
Displayed 29 items.
- On duality for Boolean programming (Q750292) (← links)
- Solving large-scale semidefinite programs in parallel (Q868469) (← links)
- Computing a nearest symmetric positive semidefinite matrix (Q1105980) (← links)
- On the need for special purpose algorithms for minimax eigenvalue problems (Q1107092) (← links)
- The embedding problem for predistance matrices (Q1176717) (← links)
- When is the greatest eigenvalue of a parametrized symmetric matrix a convex function of the parameter? (Q1187386) (← 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)
- Mixed method for solving the general convex programming problem (Q1288666) (← links)
- Sensitivity analysis of the largest dependent eigenvalue functions of eigensystems (Q1294264) (← links)
- Hybrid methods for solving the educational testing problem (Q1298524) (← links)
- Sensitivity analysis of the gratest eigenvalue of a symmetric matrix via the \(\epsilon\)-subdifferential of the associated convex quadratic form (Q1321302) (← links)
- An optimization problem on subsets of the symmetric positive-semidefinite matrices (Q1321430) (← links)
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices (Q1321653) (← links)
- A sparse nonlinear optimization algorithm (Q1337223) (← links)
- On minimizing the largest eigenvalue of a symmetric matrix (Q1345514) (← links)
- Uniqueness of the solutions of some completion problems (Q1887497) (← links)
- On a positive semidefinite relaxation of the cut polytope (Q1894508) (← links)
- Positive definite constrained least-squares estimation of matrices (Q1902117) (← links)
- Some geometric results in semidefinite programming (Q1905963) (← links)
- A primal-dual potential reduction method for problems involving matrix inequalities (Q1922696) (← links)
- Error bounds for eigenvalue and semidefinite matrix inequality systems (Q2576734) (← links)
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods (Q2576741) (← links)
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods (Q2576742) (← links)
- (Q2713568) (← links)
- On conjugate functions, subgradients, and directional derivatives of a class of optimality criteria in experimental design (Q3985822) (← links)
- Does optimality imply ill-posedness? some remarks about certain min-max optimization problems (Q4512753) (← links)
- Sensitivity analysis of nondifferentiable sums of singular values of rectangular matrices (Q4844891) (← links)
- Computation of the distance to semi-algebraic sets (Q4941311) (← links)