The following pages link to SeDuMi (Q16192):
Displaying 50 items.
- Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes (Q2022606) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions (Q2026726) (← links)
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints (Q2026764) (← links)
- T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming (Q2026772) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials (Q2028496) (← links)
- Tensor \(Z\)-eigenvalue complementarity problems (Q2028497) (← links)
- On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320) (← links)
- In between the \(LQG/H_2\)- and \(H_{\infty } \)-control theories (Q2034820) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- An exact handling of the gradient for overcoming persistent problems in nonlinear observer design via convex optimization techniques (Q2049249) (← links)
- Fast and robust certifiable estimation of the relative pose between two calibrated cameras (Q2051144) (← links)
- Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction (Q2052380) (← links)
- A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
- Stability analysis of Takagi-Sugeno systems using a switched fuzzy Lyapunov function (Q2053878) (← links)
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex (Q2057228) (← links)
- Twin minimax probability machine for pattern classification (Q2057726) (← links)
- Properties of optimal regression designs under the second-order least squares estimator (Q2066486) (← links)
- A prediction-correction inexact alternating direction method for convex nonlinear second-order cone programming with linear constraints (Q2069275) (← links)
- Structural reliability under uncertainty in moments: distributionally-robust reliability-based design optimization (Q2070152) (← links)
- Mixed-sensitivity \(\mathcal{L}_2\) controller synthesis for discrete-time LPV/LFR systems (Q2071181) (← links)
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space (Q2079694) (← links)
- A multivariate Chebyshev bound of the Selberg form (Q2081114) (← links)
- Output-based optimal \(L_1\)-gain control of weighted edge-dependent switching positive systems by a new copositive Lyapunov function (Q2085167) (← links)
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria (Q2088964) (← links)
- Second-order cone and semidefinite methods for the bisymmetric matrix approximation problem (Q2091722) (← links)
- Towards a Taylor-Carleman bilinearization approach for the design of nonlinear state-feedback controllers (Q2095299) (← links)
- Robust attitude tracking on the special orthogonal group \(SO(3)\) using PD-type state feedback and linear matrix inequalities (Q2095338) (← links)
- Stealthy attacks and attack-resilient interval observers (Q2097713) (← links)
- A method for reducing implementation complexity in linear parameter-varying controllers (Q2097743) (← links)
- Automated verification and synthesis of stochastic hybrid systems: a survey (Q2097770) (← links)
- Interval analysis of worst-case stationary moments for stochastic chemical reactions with uncertain parameters (Q2097819) (← links)
- Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming (Q2105455) (← links)
- Distributionally robust optimization with moment ambiguity sets (Q2111170) (← links)
- An SDP relaxation method for Perron pairs of a nonnegative tensor (Q2113709) (← links)
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems (Q2115211) (← links)
- A convex optimization approach to synthesizing state feedback data-driven controllers for switched linear systems (Q2116667) (← links)
- Solving symmetric and positive definite second-order cone linear complementarity problem by a rational Krylov subspace method (Q2120802) (← links)
- Local saddle points for unconstrained polynomial optimization (Q2125068) (← links)
- System-level, input-output and new parameterizations of stabilizing controllers, and their numerical computation (Q2125497) (← links)
- Controlling synchronization in a complex network of nonlinear oscillators via feedback linearisation and \(\mathcal{H}_\infty\)-control (Q2131664) (← links)
- Accelerated proximal gradient method for bi-modulus static elasticity (Q2138312) (← links)
- A globally convergent method for solving a quartic generalized Markowitz portfolio problem (Q2143112) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization (Q2149553) (← links)
- Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
