The following pages link to SDPT3 (Q16199):
Displaying 50 items.
- Distributed control of nonstationary LPV systems over arbitrary graphs (Q1678570) (← links)
- On computing the distance to stability for matrices using linear dissipative Hamiltonian systems (Q1679841) (← links)
- Balanced truncation model reduction of nonstationary systems interconnected over arbitrary graphs (Q1679882) (← links)
- Sparsity enabled cluster reduced-order models for control (Q1683852) (← links)
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems (Q1688449) (← links)
- A semi-analytical approach for the positive semidefinite Procrustes problem (Q1688909) (← links)
- Sparse tangent portfolio selection via semi-definite relaxation (Q1694793) (← links)
- A low complexity semidefinite relaxation for large-scale MIMO detection (Q1702828) (← links)
- Exact simultaneous recovery of locations and structure from known orientations and corrupted point correspondences (Q1704899) (← links)
- A new nonconvex approach to low-rank matrix completion with application to image inpainting (Q1710943) (← links)
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint (Q1717222) (← links)
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem (Q1724494) (← links)
- Suspended load path tracking control using a tilt-rotor UAV based on zonotopic state estimation (Q1730037) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- A novel unified approach to invariance conditions for a linear dynamical system (Q1735111) (← links)
- A multilevel analysis of the Lasserre hierarchy (Q1735163) (← links)
- Learning semidefinite regularizers (Q1740575) (← links)
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (Q1741115) (← links)
- ADMM for the SDP relaxation of the QAP (Q1741118) (← links)
- Accelerated proximal gradient method for elastoplastic analysis with von Mises yield criterion (Q1742869) (← links)
- Positive definiteness of paired symmetric tensors and elasticity tensors (Q1743944) (← links)
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system (Q1744121) (← links)
- Tensor eigenvalues and their applications (Q1746066) (← links)
- Robust two-stage stochastic linear optimization with risk aversion (Q1752187) (← links)
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
- The Russell measure model: computational aspects, duality, and profit efficiency (Q1754336) (← links)
- Maximum-entropy sampling and the Boolean quadric polytope (Q1756791) (← links)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers (Q1756794) (← links)
- An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers (Q1760902) (← links)
- Robust hedging strategies (Q1761191) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Efficient algorithms for the smallest enclosing ball problem (Q1774576) (← links)
- Sparsity in sums of squares of polynomials (Q1777218) (← links)
- Product-form Cholesky factorization in interior point methods for second-order cone programming (Q1777219) (← links)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
- Simplified semidefinite and completely positive relaxations (Q1785437) (← links)
- Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach (Q1787322) (← links)
- Computational methods for elastoplasticity: an overview of conventional and \textit{less-conventional} approaches (Q1787380) (← links)
- Sparse feedback design in discrete-time linear systems (Q1792585) (← links)
- Solving analysis problem with input and output disturbances (Q1792599) (← links)
- Feature scaling via second-order cone programming (Q1793515) (← links)
- Sparsely distributed sliding mode control for interconnected systems (Q1796648) (← links)
- Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
- An efficient second-order cone programming approach for optimal selection in tree breeding (Q1800455) (← links)
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems (Q1810968) (← links)
- Interior point methods for second-order cone programming and OR applications (Q1888149) (← links)
- International portfolio management with affine policies (Q1927003) (← links)
- The convex geometry of linear inverse problems (Q1928276) (← links)
- Homogeneous self-dual algorithms for stochastic semidefinite programming (Q1935265) (← links)
