scientific article
From MaRDI portal
Publication:3923971
zbMath0469.90088MaRDI QIDQ3923971
Jonathan M. Borwein, Henry Wolkowicz
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
vector optimizationLagrange multipliersymmetric matricesSlater's conditionfacial reductionstrong duality theoremoptimality characterizationminimal conefinite dimensional rangeabstract convex programcone of positive semi-definite matricesfirst order subgradient characterization
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)
Related Items
The nonnegative MINQUE estimate, A simple constraint qualification in infinite dimensional programming, Some geometric results in semidefinite programming, Explicit solutions for interval semidefinite linear programs, Immobile indices and CQ-free optimality criteria for linear copositive programming problems, Strong duality and minimal representations for cone optimization, Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs, A note on the SDP relaxation of the minimum cut problem, Lagrangian duality in convex conic programming with simple proofs, Regularizing the abstract convex program, Some applications of optimization in matrix theory, A strengthened test for optimality, Generalizations of Slater's constraint qualification for infinite convex programs, Preprocessing and Regularization for Degenerate Semidefinite Programs, Validating numerical semidefinite programming solvers for polynomial invariants, Perturbation analysis of singular semidefinite programs and its applications to control problems, Optimality conditions for linear copositive programming problems with isolated immobile indices, The minimal cone for conic linear programming, Error Bounds and Singularity Degree in Semidefinite Programming
