Semi-Definite Matrix Constraints in Optimization
From MaRDI portal
Recommendations
Cited in
(56)- Contracting optimally an interval matrix without loosing any positive semi-definite matrix is a tractable problem
- Semidefinite programming for the educational testing problem
- Minimal compact operators, subdifferential of the maximum eigenvalue and semi-definite programming
- Hybrid methods for solving the educational testing problem
- On minimizing the largest eigenvalue of a symmetric matrix
- On the need for special purpose algorithms for minimax eigenvalue problems
- A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix
- A new decomposition method for variational inequalities with linear constraints
- A sparse nonlinear optimization algorithm
- A linear model for production management-optimal solving policies
- Sensitivity analysis of nondifferentiable sums of singular values of rectangular matrices
- A primal-dual potential reduction method for problems involving matrix inequalities
- Method of centers for minimizing generalized eigenvalues
- Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints
- Computing a nearest symmetric positive semidefinite matrix
- Second-order nonsmooth optimization for \(H_{\infty}\) synthesis
- Does optimality imply ill-posedness? some remarks about certain min-max optimization problems
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
- Optimality conditions in semidefinite programming
- A nonlinear SDP approach to fixed-order controller synthesis and comparison with two other methods applied to an active suspension system
- Solving large-scale semidefinite programs in parallel
- Sensitivity analysis of the largest dependent eigenvalue functions of eigensystems
- Extremal problems on the set of nonnegative definite matrices
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- Computing the nearest diagonally dominant matrix
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- Computation of the distance to semi-algebraic sets
- Uniqueness of the solutions of some completion problems
- An inexact spectral bundle method for convex quadratic semidefinite programming
- Positive definite constrained least-squares estimation of matrices
- On duality for Boolean programming
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- \(LDL^T\) direction interior point method for semidefinite programming
- The spectral bundle method with second-order information
- Sensitivity analysis of the gratest eigenvalue of a symmetric matrix via the \(\epsilon\)-subdifferential of the associated convex quadratic form
- Error bounds for eigenvalue and semidefinite matrix inequality systems
- On conjugate functions, subgradients, and directional derivatives of a class of optimality criteria in experimental design
- The educational testing problem revisited
- Mixed method for solving the general convex programming problem
- Second-order conditions for existence of augmented Lagrange multipliers for eigenvalue composite optimization problems
- A second-order bundle method based on \(\mathcal{UV}\)-decomposition strategy for a special class of eigenvalue optimizations
- An optimization problem on subsets of the symmetric positive-semidefinite matrices
- On a positive semidefinite relaxation of the cut polytope
- An improved general extra-gradient method with refined step size for nonlinear monotone variational inequalities
- Some geometric results in semidefinite programming
- Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
- When is the greatest eigenvalue of a parametrized symmetric matrix a convex function of the parameter?
- Global convergence of the alternating projection method for the max-cut relaxation problem
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Condition number minimization in Euclidean Jordan algebras
- The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications
- The embedding problem for predistance matrices
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
- A space decomposition scheme for maximum eigenvalue functions and its applications
- Concrete minimal 3 3 Hermitian matrices and some general cases
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
This page was built for publication: Semi-Definite Matrix Constraints in Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683922)
