Pages that link to "Item:Q4504792"
From MaRDI portal
The following pages link to SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 (Q4504792):
Displaying 50 items.
- SDPT3 (Q16199) (← links)
- Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination (Q126401) (← links)
- Latent variable graphical model selection via convex optimization (Q132216) (← links)
- Primal recovery from consensus-based dual decomposition for distributed convex optimization (Q255083) (← links)
- Advances in computational Lyapunov analysis using sum-of-squares programming (Q258390) (← links)
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- Topology selection for multi-agent systems with opposite leaders (Q288912) (← links)
- Delay-independent stability analysis of linear time-delay systems based on frequency discretization (Q290892) (← links)
- A new gradient projection method for matrix completion (Q300199) (← links)
- Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
- Robust filter design for a class of uncertain systems with \(\mathcal D\) stability constraints under a unified framework (Q325718) (← links)
- Robust stability and performance analysis based on integral quadratic constraints (Q328242) (← links)
- New results on robust control for a class of uncertain systems and its applications to Chua's oscillator (Q333148) (← links)
- Phase retrieval for imaging problems (Q340015) (← links)
- \(H_{\infty }\) consensus of nonlinear multi-agent systems using dynamic output feedback controller: an LMI approach (Q345586) (← links)
- Robust international portfolio management (Q373171) (← links)
- Alternating projections on nontangential manifolds (Q387545) (← links)
- CVXGEN: a code generator for embedded convex optimization (Q399985) (← links)
- POS3POLY -- a MATLAB preprocessor for optimization with positive polynomials (Q402198) (← links)
- Improving an upper bound on the size of \(k\)-regular induced subgraphs (Q411262) (← links)
- Abstract interpretation meets convex optimization (Q435969) (← links)
- Stochastic receding horizon control with output feedback and bounded controls (Q445037) (← links)
- An alternating variable method for the maximal correlation problem (Q445332) (← links)
- Robust portfolio optimization: a conic programming approach (Q453610) (← links)
- Robust least square semidefinite programming with applications (Q457207) (← links)
- On real-time robust model predictive control (Q462327) (← links)
- Lossless convexification of non-convex optimal control problems for state constrained linear systems (Q466469) (← links)
- On local convexity of quadratic transformations (Q489135) (← links)
- Construction of an optimal background profile for the Kuramoto-Sivashinsky equation using semidefinite programming (Q489455) (← links)
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems (Q495943) (← links)
- Robust observed-state feedback design for discrete-time systems rational in the uncertainties (Q503147) (← links)
- On reduced semidefinite programs for second order moment bounds with applications (Q507337) (← links)
- Noise covariance identification for nonlinear systems using expectation maximization and moving horizon estimation (Q510145) (← links)
- A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (Q523579) (← links)
- Robust multi-view \(L_2\) triangulation via optimal inlier selection and 3D structure refinement (Q531265) (← links)
- Model reduction of homogeneous-in-the-state bilinear systems with input constraints (Q534296) (← links)
- Convergence of fixed-point continuation algorithms for matrix rank minimization (Q535287) (← links)
- Extension of smoothing Newton algorithms to solve linear programming over symmetric cones (Q545466) (← links)
- A semidefinite programming study of the Elfving theorem (Q546096) (← links)
- Optimal selection of reduced rank estimators of high-dimensional matrices (Q548562) (← links)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
- Motion planning for flat systems using positive B-splines: an LMI approach (Q608434) (← links)
- Angular synchronization by eigenvectors and semidefinite programming (Q617701) (← links)
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection (Q621755) (← links)
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming (Q623727) (← links)
- Lossless convexification of a class of optimal control problems with non-convex control constraints (Q627079) (← links)
- Sparse approximation of functions using sums of exponentials and AAK theory (Q630493) (← links)
- Testing the nullspace property using semidefinite programming (Q633104) (← links)
- Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach (Q646169) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
