Pages that link to "Item:Q4504796"
From MaRDI portal
The following pages link to Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones (Q4504796):
Displaying 50 items.
- 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 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)
- Do semidefinite relaxations solve sparse PCA up to the information limit? (Q2352742) (← links)
- A new semidefinite relaxation for \(L_{1}\)-constrained quadratic (Q2353474) (← links)
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm (Q2354819) (← links)
- Active allocation of systematic risk and control of risk sensitivity in portfolio optimization (Q2355106) (← links)
- Distributed consensus of linear multi-agent systems with adaptive dynamic protocols (Q2356649) (← links)
- Decentralized observer-based control via networked communication (Q2356662) (← links)
- Credible autocoding of convex optimization algorithms (Q2358081) (← links)
- An efficient cutting plane algorithm for the smallest enclosing circle problem (Q2358480) (← links)
- Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines (Q2359408) (← links)
- Ellipsoidal support vector clustering for functional MRI analysis (Q2373465) (← links)
- Optimal correction of an indefinite estimated MA spectral density matrix (Q2373685) (← links)
- Region of attraction estimation using invariant sets and rational Lyapunov functions (Q2374461) (← links)
- Inverse problems from biomedicine: inference of putative disease mechanisms and robust therapeutic strategies (Q2376849) (← links)
- Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
- Computing sum of squares decompositions with rational coefficients (Q2378506) (← links)
- Kernel based support vector machine via semidefinite programming: application to medical diagnosis (Q2379646) (← links)
- Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem (Q2383649) (← links)
- Structured large margin machines: sensitive to data distributions (Q2384161) (← links)
