Pages that link to "Item:Q1935573"
From MaRDI portal
The following pages link to Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (Q1935573):
Displaying 24 items.
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- Facial reduction algorithms for conic optimization problems (Q368590) (← links)
- A facial reduction algorithm for finding sparse SOS representations (Q613325) (← links)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization (Q1926632) (← links)
- Numerical algebraic geometry and semidefinite programming (Q1979983) (← links)
- Perturbation analysis of singular semidefinite programs and its applications to control problems (Q2026715) (← links)
- Douglas-Rachford splitting and ADMM for pathological convex optimization (Q2282817) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs (Q2316619) (← links)
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs (Q2802543) (← links)
- Perturbed sums-of-squares theorem for polynomial optimization and its applications (Q2811486) (← links)
- Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization (Q4983492) (← links)
- Bounds on heat transport for convection driven by internal heating (Q4993136) (← links)
- Solving SDP completely with an interior point oracle (Q4999336) (← links)
- A paradox in bosonic energy computations via semidefinite programming relaxations (Q5141427) (← links)
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization (Q5233101) (← links)
- Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs (Q5243181) (← links)
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach (Q5275296) (← links)
- Error Bounds and Singularity Degree in Semidefinite Programming (Q5857289) (← links)
- Validating numerical semidefinite programming solvers for polynomial invariants (Q5916266) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5918421) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5925641) (← links)
- Strong duality in lasserre's hierarchy for polynomial optimization (Q5963686) (← links)
