Semi-Definite Matrix Constraints in Optimization

From MaRDI portal
Revision as of 07:54, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3683922

DOI10.1137/0323032zbMath0567.90088OpenAlexW2007179152MaRDI QIDQ3683922

Roger Fletcher

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




Related Items (51)

A linear model for production management—optimal solving policiesA sparse nonlinear optimization algorithmUniqueness of the solutions of some completion problemsOn minimizing the largest eigenvalue of a symmetric matrixOn a positive semidefinite relaxation of the cut polytopeUnnamed ItemOn conjugate functions, subgradients, and directional derivatives of a class of optimality criteria in experimental designPositive definite constrained least-squares estimation of matricesA Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue OptimizationsComputing a nearest symmetric positive semidefinite matrixOn the need for special purpose algorithms for minimax eigenvalue problemsSome geometric results in semidefinite programmingCondition Number Minimization in Euclidean Jordan AlgebrasThe spectral bundle method with second-order informationSolving large-scale semidefinite programs in parallelSpecial backtracking proximal bundle method for nonconvex maximum eigenvalue optimizationA space decomposition scheme for maximum eigenvalue functions and its applicationsA primal-dual potential reduction method for problems involving matrix inequalitiesSpeeDP: an algorithm to compute SDP bounds for very large max-cut instancesSensitivity analysis of nondifferentiable sums of singular values of rectangular matricesThe space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applicationsA new decomposition method for variational inequalities with linear constraints$LDL^T$ Direction Interior Point Method for Semidefinite ProgrammingFirst order optimality conditions for mathematical programs with semidefinite cone complementarity constraintsThe embedding problem for predistance matricesSecond-order nonsmooth optimization for \(H_{\infty}\) synthesisAn improved general extra-gradient method with refined step size for nonlinear monotone variational inequalitiesSecond-order conditions for existence of augmented Lagrange multipliers for eigenvalue composite optimization problemsWhen 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 casesSemidefinite programming for the educational testing problemA fast space-decomposition scheme for nonconvex eigenvalue optimizationAn inexact spectral bundle method for convex quadratic semidefinite programmingLocal convergence of an augmented Lagrangian method for matrix inequality constrained programmingComputation of the distance to semi-algebraic setsA nonlinear SDP approach to fixed-order controller synthesis and comparison with two other methods applied to an active suspension systemMethod of centers for minimizing generalized eigenvaluesA quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrixOn duality for Boolean programmingMixed method for solving the general convex programming problemSensitivity analysis of the largest dependent eigenvalue functions of eigensystemsHybrid methods for solving the educational testing problemGlobal convergence of the alternating projection method for the Max-Cut relaxation problemError bounds for eigenvalue and semidefinite matrix inequality systemsSpectral bundle methods for non-convex maximum eigenvalue functions: first-order methodsSpectral bundle methods for non-convex maximum eigenvalue functions: second-order methodsDoes optimality imply ill-posedness? some remarks about certain min-max optimization problemsSensitivity analysis of the gratest eigenvalue of a symmetric matrix via the \(\epsilon\)-subdifferential of the associated convex quadratic formAn optimization problem on subsets of the symmetric positive-semidefinite matricesOptimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matricesOptimality Conditions in Semidefinite Programming







This page was built for publication: Semi-Definite Matrix Constraints in Optimization