Semi-Definite Matrix Constraints in Optimization
From MaRDI portal
Publication:3683922
DOI10.1137/0323032zbMath0567.90088MaRDI QIDQ3683922
Publication date: 1985
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0323032
Lagrange multipliers; nonsmooth optimization; normal cone; optimality conditions; extreme eigenvalues; subgradients; exact penalty function; educational testing; feasible directions; matrix modification; Positive semi-definite matrix constraints
Related Items
Does optimality imply ill-posedness? some remarks about certain min-max optimization problems, Sensitivity analysis of nondifferentiable sums of singular values of rectangular matrices, Computation of the distance to semi-algebraic sets, On duality for Boolean programming, Solving large-scale semidefinite programs in parallel, Computing a nearest symmetric positive semidefinite matrix, On the need for special purpose algorithms for minimax eigenvalue problems, The embedding problem for predistance matrices, When is the greatest eigenvalue of a parametrized symmetric matrix a convex function of the parameter?, Method of centers for minimizing generalized eigenvalues, A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix, Mixed method for solving the general convex programming problem, Sensitivity analysis of the largest dependent eigenvalue functions of eigensystems, Hybrid methods for solving the educational testing problem, Sensitivity analysis of the gratest eigenvalue of a symmetric matrix via the \(\epsilon\)-subdifferential of the associated convex quadratic form, An optimization problem on subsets of the symmetric positive-semidefinite matrices, Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices, A sparse nonlinear optimization algorithm, On minimizing the largest eigenvalue of a symmetric matrix, Uniqueness of the solutions of some completion problems, On a positive semidefinite relaxation of the cut polytope, Positive definite constrained least-squares estimation of matrices, Some geometric results in semidefinite programming, A primal-dual potential reduction method for problems involving matrix inequalities, Error bounds for eigenvalue and semidefinite matrix inequality systems, Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods, Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods, Unnamed Item, On conjugate functions, subgradients, and directional derivatives of a class of optimality criteria in experimental design
