The following pages link to CSDP (Q12937):
Displaying 50 items.
- Semidefinite programming for uncertain linear equations in static analysis of structures (Q2638116) (← links)
- Copositivity cuts for improving SDP bounds on the clique number (Q2638373) (← links)
- Linear matrix inequalities in control systems with uncertainty (Q2660497) (← links)
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework (Q2706347) (← links)
- Sufficient conditions for the synthesis ofH? fixed-order controllers (Q2708056) (← links)
- A team algorithm for robust stability analysis and control design of uncertain time-varying linear systems using piecewise quadratic Lyapunov functions (Q2716778) (← links)
- Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming (Q2757588) (← links)
- The State-of-the-Art in Conic Optimization Software (Q2802542) (← links)
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs (Q2802543) (← links)
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations (Q2826815) (← links)
- A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs (Q2835666) (← links)
- Exact Solution Methods for the k-Item Quadratic Knapsack Problem (Q2835673) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- Global Stability Analysis of Nonlinear Sampled-Data Systems Using Convex Methods (Q2863195) (← links)
- An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application (Q2879514) (← links)
- Numerical Study of Semidefinite Bounds for the k-cluster Problem (Q2883586) (← links)
- A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access (Q2892140) (← links)
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs (Q2897305) (← links)
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes (Q2901038) (← links)
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem (Q2958360) (← links)
- On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs (Q2978191) (← links)
- Stabhyli (Q2986914) (← links)
- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem (Q3005390) (← links)
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations (Q3008019) (← links)
- (Q3070753) (← links)
- Hypergraphs Do Jump (Q3081326) (← links)
- (Q3102312) (← links)
- AN EXTENSION OF THE ELIMINATION METHOD FOR A SPARSE SOS POLYNOMIAL(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)) (Q3144757) (← links)
- Algorithm 925 (Q3189662) (← links)
- A Solution to the 2/3 Conjecture (Q3192162) (← links)
- Preprocessing sparse semidefinite programs via matrix completion (Q3377970) (← links)
- Optimization Schemes For Wireless Sensor Network Localization (Q3391483) (← links)
- Provably near-optimal solutions for very large single-row facility layout problems (Q3396400) (← links)
- (Q3397670) (← links)
- (Q3416557) (← links)
- Solving minimum K-cardinality cut problems in planar graphs (Q3418207) (← links)
- Robust Network Design with Uncertain Outsourcing Cost (Q3458750) (← links)
- Verifying Nonlinear Real Formulas Via Sums of Squares (Q3523169) (← links)
- Automating Verification of Cooperation, Control, and Design in Traffic Applications (Q3526930) (← links)
- Rethinking Biased Estimation: Improving Maximum Likelihood and the Cramér–Rao Bound (Q3530807) (← links)
- On a matrix inequality and its application to the synchronization in coupled chaotic systems (Q3534363) (← links)
- On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization (Q3544263) (← links)
- Algorithm 875 (Q3549240) (← links)
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster (Q3562409) (← links)
- New upper bounds for kissing numbers from semidefinite programming (Q3577299) (← links)
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification (Q3584157) (← links)
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints (Q3584167) (← links)
- On Convex Functions and the Finite Element Method (Q3584640) (← links)
- Towards Component Based Design of Hybrid Systems: Safety and Stability (Q3587253) (← links)
