The following pages link to SeDuMi (Q16192):
Displaying 50 items.
- A multilevel analysis of the Lasserre hierarchy (Q1735163) (← links)
- Noncircular sources-based sparse representation algorithm for direction of arrival estimation in MIMO radar with mutual coupling (Q1736830) (← links)
- Robust performance for uncertain systems via Lyapunov functions with higher order terms (Q1738584) (← links)
- A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane (Q1744887) (← links)
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907) (← links)
- Tensor eigenvalues and their applications (Q1746066) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
- A non-uniform multi-rate control strategy for a Markov chain-driven networked control system (Q1750019) (← links)
- Multi-class second-order cone programming support vector machines (Q1750615) (← links)
- Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
- Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225) (← links)
- Tensor maximal correlation problems (Q1753137) (← links)
- Polynomial optimization for water networks: global solutions for the valve setting problem (Q1753591) (← links)
- The Russell measure model: computational aspects, duality, and profit efficiency (Q1754336) (← links)
- Stability, \(L_1\)-gain analysis and asynchronous \(L_1\)-gain control of uncertain discrete-time switched positive linear systems with dwell time (Q1757511) (← links)
- The cosparse analysis model and algorithms (Q1762317) (← links)
- Quadratic optimization in the problems of active control of sound (Q1763630) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Efficient algorithms for the smallest enclosing ball problem (Q1774576) (← links)
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position (Q1774976) (← 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)
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems (Q1777422) (← links)
- Inverse conic programming with applications (Q1779714) (← links)
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
- Design of planar articulated mechanisms using branch and bound (Q1780959) (← links)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← 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)
- Algorithms for positive semidefinite factorization (Q1790680) (← links)
- A new conic approach to semisupervised support vector machines (Q1793456) (← links)
- Feature scaling via second-order cone programming (Q1793515) (← links)
- Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach (Q1797040) (← links)
- Bibo stabilisation of continuous-time Takagi-Sugeno systems under persistent perturbations and input saturation (Q1797868) (← links)
- An efficient second-order cone programming approach for optimal selection in tree breeding (Q1800455) (← links)
- Exact algorithms for the chance-constrained vehicle routing problem (Q1800993) (← links)
- Solution methodologies for the smallest enclosing circle problem (Q1810982) (← links)
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming (Q1812072) (← links)
- On semidefinite programming relaxations of \((2+p)\)-SAT (Q1861907) (← links)
- Approximation algorithm for MAX DICUT with given sizes of parts (Q1879136) (← links)
- Interior point methods for second-order cone programming and OR applications (Q1888149) (← links)
- On robust solutions to linear least squares problems affected by data uncertainty and implementation errors with application to stochastic signal modeling (Q1888347) (← links)
- On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
- On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization (Q1926632) (← links)
- A semidefinite approach for truncated \(K\)-moment problems (Q1928277) (← links)
- Shape-based object detection via boundary structure segmentation (Q1931604) (← links)
- Convex approximations in stochastic programming by semidefinite programming (Q1931652) (← links)
- A negative-imaginary lemma without minimality assumptions and robust state-feedback synthesis for uncertain negative-imaginary systems (Q1932747) (← links)
- Robust estimation for an inverse problem arising in multiview geometry (Q1932929) (← links)
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (Q1935573) (← links)
