Pages that link to "Item:Q4664050"
From MaRDI portal
The following pages link to Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0) (Q4664050):
Displayed 20 items.
- Abstract interpretation meets convex optimization (Q435969) (← links)
- Robust synchronization analysis in nonlinear stochastic cellular networks with time-varying delays, intracellular perturbations and intercellular noise (Q554481) (← links)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming (Q623727) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Sparsity in sums of squares of polynomials (Q1777218) (← links)
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture (Q2385546) (← links)
- Semidefinite programming based approaches to the break minimization problem (Q2583777) (← links)
- Semidefinite programming for uncertain linear equations in static analysis of structures (Q2638116) (← links)
- A conversion of an SDP having free variables into the standard form SDP (Q2643612) (← links)
- On the estimation of robustness and filtering ability of dynamic biochemical networks under process delays, internal parametric perturbations and external disturbances (Q2654375) (← links)
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials (Q3093048) (← links)
- Low-rank exploitation in semidefinite programming for control (Q3119148) (← links)
- Preprocessing sparse semidefinite programs via matrix completion (Q3377970) (← links)
- A Maximum Likelihood Approach to Density Estimation with Semidefinite Programming (Q3413092) (← links)
- Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
- Computational enhancements in low-rank semidefinite programming (Q5475287) (← links)