Semi-Definite Matrix Constraints in Optimization
From MaRDI portal
Publication:3683922
DOI10.1137/0323032zbMath0567.90088OpenAlexW2007179152MaRDI 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 multipliersnonsmooth optimizationnormal coneoptimality conditionsextreme eigenvaluessubgradientsexact penalty functioneducational testingfeasible directionsmatrix modificationPositive semi-definite matrix constraints
Related Items
A linear model for production management—optimal solving policies, A sparse nonlinear optimization algorithm, Uniqueness of the solutions of some completion problems, On minimizing the largest eigenvalue of a symmetric matrix, On a positive semidefinite relaxation of the cut polytope, Unnamed Item, On conjugate functions, subgradients, and directional derivatives of a class of optimality criteria in experimental design, Positive definite constrained least-squares estimation of matrices, A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations, Computing a nearest symmetric positive semidefinite matrix, On the need for special purpose algorithms for minimax eigenvalue problems, Some geometric results in semidefinite programming, Condition Number Minimization in Euclidean Jordan Algebras, The spectral bundle method with second-order information, Solving large-scale semidefinite programs in parallel, Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization, A space decomposition scheme for maximum eigenvalue functions and its applications, A primal-dual potential reduction method for problems involving matrix inequalities, SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances, Sensitivity analysis of nondifferentiable sums of singular values of rectangular matrices, The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications, A new decomposition method for variational inequalities with linear constraints, $LDL^T$ Direction Interior Point Method for Semidefinite Programming, First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints, The embedding problem for predistance matrices, Second-order nonsmooth optimization for \(H_{\infty}\) synthesis, An improved general extra-gradient method with refined step size for nonlinear monotone variational inequalities, Second-order conditions for existence of augmented Lagrange multipliers for eigenvalue composite optimization problems, When is the greatest eigenvalue of a parametrized symmetric matrix a convex function of the parameter?, Concrete minimal \(3 \times 3\) Hermitian matrices and some general cases, Semidefinite programming for the educational testing problem, A fast space-decomposition scheme for nonconvex eigenvalue optimization, An inexact spectral bundle method for convex quadratic semidefinite programming, Local convergence of an augmented Lagrangian method for matrix inequality constrained programming, Computation of the distance to semi-algebraic sets, A nonlinear SDP approach to fixed-order controller synthesis and comparison with two other methods applied to an active suspension system, Method of centers for minimizing generalized eigenvalues, A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix, On duality for Boolean programming, 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, Global convergence of the alternating projection method for the Max-Cut relaxation problem, 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, Does optimality imply ill-posedness? some remarks about certain min-max optimization problems, 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, Optimality Conditions in Semidefinite Programming
