The following pages link to SeDuMi (Q16192):
Displaying 50 items.
- Lyapunov based estimation of the basin of attraction of Poincaré maps with applications to limit cycle walking (Q2283236) (← links)
- Suboptimal anisotropic filtering for linear discrete nonstationary systems with uncentered external disturbance (Q2287154) (← links)
- Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- Minimal conic quadratic reformulations and an optimization model (Q2294364) (← links)
- Feature uncertainty bounds for explicit feature maps and large robust nonlinear SVM classifiers (Q2294606) (← links)
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs (Q2297655) (← links)
- Robust performance and observer based control for periodic discrete-time uncertain systems (Q2298589) (← links)
- LMI-based robust control of uncertain nonlinear systems via polytopes of polynomials (Q2299086) (← links)
- An LMI-based heuristic algorithm for vertex reduction in LPV systems (Q2299196) (← links)
- Exploiting Lagrange duality for topology optimization with frictionless unilateral contact (Q2300950) (← links)
- Stability analysis and output-feedback synthesis of hybrid systems affected by piecewise constant parameters via dynamic resetting scalings (Q2304037) (← links)
- A semidefinite relaxation method for second-order cone polynomial complementarity problems (Q2307702) (← links)
- SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection (Q2307706) (← links)
- Higher-degree tensor eigenvalue complementarity problems (Q2307709) (← links)
- Saddle points of rational functions (Q2307710) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- Sequential parametric convex approximation algorithm for bilinear matrix inequality problem (Q2311107) (← links)
- Immediate schedule adjustment and semidefinite relaxation (Q2313755) (← links)
- Test of copositive tensors (Q2313772) (← links)
- A semidefinite relaxation algorithm for checking completely positive separable matrices (Q2313773) (← links)
- An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem (Q2316190) (← links)
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms (Q2316618) (← links)
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs (Q2316619) (← links)
- Observer-based state-feedback control design for LPV periodic discrete-time systems (Q2318797) (← links)
- Template polyhedra and bilinear optimization (Q2322312) (← links)
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
- Co-design of aperiodic sampled-data min-jumping rules for linear impulsive, switched impulsive and sampled-data systems (Q2327397) (← links)
- Robust output-feedback control for uncertain linear sampled-data systems: a 2D impulsive system approach (Q2327609) (← links)
- Improved row-by-row method for binary quadratic optimization problems (Q2327692) (← links)
- Ultimate boundedness sufficient conditions for nonlinear systems using TS fuzzy modelling (Q2328902) (← links)
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints (Q2329678) (← links)
- T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method (Q2329795) (← links)
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
- An offline formulation of MPC for LPV systems using linear matrix inequalities (Q2336715) (← links)
- A local and global classification machine with collaborative mechanism (Q2337485) (← links)
- Proximal gradient method for huberized support vector machine (Q2337512) (← links)
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization (Q2340336) (← links)
- A non-convex algorithm framework based on DC programming and DCA for matrix completion (Q2340366) (← links)
- Periodically time-varying memory static output feedback control design for discrete-time LTI systems (Q2342751) (← links)
- Minimizing trigonometric matrix polynomials over semi-algebraic sets (Q2342782) (← links)
- \(\mathcal{H}_\infty\) state feedback control for MJLS with uncertain probabilities (Q2342791) (← links)
- Efficient upper and lower bounds for global mixed-integer optimal control (Q2342951) (← links)
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization (Q2346399) (← links)
- On minimizing a quadratic function on Stiefel manifold (Q2347364) (← links)
- Convex conditions for robust stabilization of uncertain switched systems with guaranteed minimum and mode-dependent dwell-time (Q2347841) (← links)
- Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
- The hierarchy of local minimums in polynomial optimization (Q2349136) (← links)
- Convex conditions for robust stability analysis and stabilization of linear aperiodic impulsive and sampled-data systems under dwell-time constraints (Q2350815) (← links)
- Do semidefinite relaxations solve sparse PCA up to the information limit? (Q2352742) (← links)
