scientific article

Henry Wolkowicz, Jonathan M. Borwein

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Lagrange multiplier theorem exposed face facial reduction optimality characterization minimal cone cone-convex programming problem

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48)

Related Items

Facial reduction in partially finite convex programming, The nonnegative MINQUE estimate, Computing sum of squares decompositions with rational coefficients, Facial reduction algorithms for conic optimization problems, SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning, Sensor network localization, Euclidean distance matrix completions, and graph realization, A facial reduction algorithm for finding sparse SOS representations, Facial Reduction and Partial Polyhedrality, Deciding Polyhedrality of Spectrahedra, A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms, Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs, A facial reduction approach for the single source localization problem, A note on the SDP relaxation of the minimum cut problem, Revisiting degeneracy, strict feasibility, stability, in linear programming, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Screening Rules and its Complexity for Active Set Identification, Prestress Stability of Triangulated Convex Polytopes and Universal Second-Order Rigidity, A strict complementarity approach to error bound and sensitivity of solution of conic programs, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, A simplified treatment of Ramana's exact dual for semidefinite programming, Characterizing the universal rigidity of generic tensegrities, Bad Semidefinite Programs: They All Look the Same, Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming, A fresh variational-analysis look at the positive semidefinite matrices world, Amenable cones: error bounds without constraint qualifications, Numerical algebraic geometry and semidefinite programming, Projection methods for quantum channel construction, On Farkas lemma and dimensional rigidity of bar frameworks, A note on alternating projections for ill-posed semidefinite feasibility problems, Weak infeasibility in second order cone programming, Conic programming: infeasibility certificates and projective geometry, Constrained best approximation in Hilbert space. II, Singularity Degree of the Positive Semidefinite Matrix Completion Problem, Application of facial reduction to H _∞ state feedback control problem, Preprocessing and Regularization for Degenerate Semidefinite Programs, Perturbation analysis of singular semidefinite programs and its applications to control problems, Douglas-Rachford splitting and ADMM for pathological convex optimization, Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem, Facial reduction for exact polynomial sum of squares decomposition, Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs, A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs, The minimal cone for conic linear programming, Facially Dual Complete (Nice) Cones and Lexicographic Tangents, Strong duality for standard convex programs, Solving SDP completely with an interior point oracle, Exact Duality in Semidefinite Programming Based on Elementary Reformulations, Error Bounds and Singularity Degree in Semidefinite Programming, Coordinate Shadows of Semidefinite and Euclidean Distance Matrices, Iterative universal rigidity