The following pages link to SeDuMi (Q16192):
Displaying 50 items.
- Performance and design of cycles in consensus networks (Q1936159) (← links)
- Computing maximin efficient experimental designs using the methods of semidefinite programming (Q1936672) (← links)
- A decomposition algorithm for KYP-SDPs (Q1937316) (← links)
- Hammerstein system identification using nuclear norm minimization (Q1937500) (← links)
- Separating doubly nonnegative and completely positive matrices (Q1942269) (← links)
- The tracial moment problem and trace-optimization of polynomials (Q1942272) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- Maxi-Min discriminant analysis via online learning (Q1942698) (← links)
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- Robust regression through the Huber's criterion and adaptive lasso penalty (Q1952217) (← links)
- A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section (Q1954820) (← links)
- Design of a Takagi-Sugeno fuzzy regulator for a set of operation points (Q1955128) (← links)
- Linear matrix inequalities in multirate control over networks (Q1955166) (← links)
- Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations (Q1955536) (← links)
- Optimal and robust waveform design for MIMO radars in the presence of clutter (Q1957223) (← links)
- Design of 2D linear phase DFT modulated filter banks using bi-iterative second-order cone program (Q1957901) (← links)
- Robust adaptive beamforming for MIMO radar (Q1957919) (← links)
- Positive hybrid real-trigonometric polynomials and applications to adjustable filter design and absolute stability analysis (Q1959357) (← links)
- Ensemble clustering using semidefinite programming with applications (Q1959572) (← links)
- Generating and measuring instances of hard semidefinite programs (Q1960189) (← links)
- Relaxations of the satisfiability problem using semidefinite programming (Q1977751) (← links)
- Numerical algebraic geometry and semidefinite programming (Q1979983) (← links)
- Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization (Q1988893) (← links)
- Negative features of hyperbolic and directional distance models for technologies with undesirable outputs (Q1989789) (← links)
- Identification of optimal feedback control rules from micro-quadrotor and insect flight trajectories (Q1990528) (← links)
- Convex low rank approximation (Q1991504) (← links)
- Portfolio management with robustness in both prediction and decision: a mixture model based learning approach (Q1991930) (← links)
- Filter design for continuous-time linear systems subject to sensor saturation (Q1992472) (← links)
- Robust nearfield wideband beamforming design based on adaptive-weighted convex optimization (Q1992836) (← links)
- A proximal fully parallel splitting method for stable principal component pursuit (Q1993345) (← links)
- Conic programming: infeasibility certificates and projective geometry (Q1996078) (← links)
- Nonlinear modeling and robust LMI fuzzy control of overhead crane systems (Q1996585) (← links)
- On unknown input observers designs for discrete-time LPV systems with bounded rates of parameter variation (Q1996692) (← links)
- Nonlinear time varying perturbation stability analysis of a double diabetes system (Q1997717) (← links)
- Duality and profit efficiency for the hyperbolic measure model (Q1999370) (← links)
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming (Q1999885) (← links)
- On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems (Q2007822) (← links)
- Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence (Q2007836) (← links)
- Observer-based stabilization of sector-bounded nonlinear stochastic systems in the presence of intermittent measurements (Q2008466) (← links)
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (Q2010087) (← links)
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
- Global non-quadratic \(\mathcal{D} \)-stabilization of Takagi-Sugeno systems with piecewise continuous membership functions (Q2010562) (← links)
- Using SeDuMi to find various optimal designs for regression models (Q2010813) (← links)
- Asymptotically necessary and sufficient conditions for Takagi-sugeno models using generalized non-quadratic parameter-dependent controller design (Q2013759) (← links)
- Generalized \(H_{\infty}\) model reduction for stable two-dimensional discrete systems (Q2014184) (← links)
- Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique (Q2014679) (← links)
- Robust stabilizing inventory control in supply networks under uncertainty of external demand and supply time-delays (Q2017661) (← links)
- A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems (Q2022328) (← links)
- Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations (Q2022383) (← links)
