frlib

MaRDI QIDQ46529swMATHFDO

Official website https://arxiv.org/abs/1408.4685

Source code repository https://github.com/frankpermenter/frlib

Described by source

• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone

Cited in

(36)

• Douglas-Rachford splitting and ADMM for pathological convex optimization
• Characterization of the dual problem of linear matrix inequality for H-infinity output feedback control problem via facial reduction
• Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
• Facially dual complete (nice) cones and lexicographic tangents
• Sparse PSD approximation of the PSD cone
• Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
• Amenable cones: error bounds without constraint qualifications
• Polyhedral approximations of the semidefinite cone and their application
• Numerical algebraic geometry and semidefinite programming
• Penalized semidefinite programming for quadratically-constrained quadratic optimization
• Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
• On polyhedral and second-order cone decompositions of semidefinite optimization problems
• scientific article; zbMATH DE number 7306888 (Why is no real title available?)
• VSDP
• FIR toolbox
• Orbital library
• SPECTRA
• SPOTless
• ADMM_QAP
• Sieve-SDP
• Characterizing bad semidefinite programs: normal forms and short proofs
• DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
• CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
• Error bounds and singularity degree in semidefinite programming
• Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
• L0BnB
• Validating numerical semidefinite programming solvers for polynomial invariants
• A simplified treatment of Ramana's exact dual for semidefinite programming
• Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
• Solving SDP completely with an interior point oracle
• A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
• Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices
• Coordinate shadows of semidefinite and Euclidean distance matrices
• Facial reduction and partial polyhedrality
• Exact Semidefinite Programming Bounds for Packing Problems
• On sums of squares of \(K\)-nomials

This page was built for software: frlib