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.
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming (Q717133) (← links)
- Conditional minimum volume ellipsoid with application to multiclass discrimination (Q732238) (← links)
- A simple prior-free method for non-rigid structure-from-motion factorization (Q740406) (← links)
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints (Q740634) (← links)
- Block splitting for distributed optimization (Q744220) (← links)
- Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones (Q747766) (← links)
- On the robustness and scalability of semidefinite relaxation for optimal power flow problems (Q779755) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- Parameter-related projection-based iterative algorithm for a kind of generalized positive semidefinite least squares problem (Q827574) (← links)
- Optimizing over the properly efficient set of convex multi-objective optimization problems (Q828826) (← links)
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
- A second-order cone cutting surface method: Complexity and application (Q839677) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- New algorithms for \(k\)-center and extensions (Q849133) (← links)
- Computational strategy for Russell measure in DEA: second-order cone programming (Q869200) (← links)
- An interval estimator for the unmixing of mixtures with set-based source descriptions (Q892187) (← links)
- A first-order block-decomposition method for solving two-easy-block structured semidefinite programs (Q892382) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- Minimal condition number for positive definite Hankel matrices using semidefinite programming (Q989049) (← links)
- A globally convergent non-interior point algorithm with full Newton step for second-order cone programming (Q993313) (← links)
- Accurate time delay estimation based passive localization (Q1032357) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- Applications of semidefinite programming (Q1294557) (← links)
- An independent benchmarking of SDP and SOCP solvers (Q1411647) (← links)
- Similarity and other spectral relations for symmetric cones (Q1573667) (← links)
- Generalizations of the field of values useful in the study of polynomial functions of a matrix (Q1611848) (← links)
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
- Hybrid energy transformation to generalized Reissner-Mindlin model for laminated composite shells (Q1625046) (← links)
- A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm (Q1631800) (← links)
- A simple necessary and sufficient LMI condition for the strong delay-independent stability of LTI systems with single delay (Q1640296) (← links)
- Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations (Q1640558) (← links)
- On exploiting inexact scheduling parameters for gain-scheduled control of linear parameter-varying discrete-time systems (Q1645064) (← links)
- Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods (Q1646571) (← links)
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity (Q1646680) (← links)
- A two-resource allocation algorithm with an application to large-scale zero-sum defensive games (Q1652078) (← links)
- Model reduction of distributed nonstationary LPV systems (Q1663015) (← links)
- Alternating direction method of multipliers for separable convex optimization of real functions in complex variables (Q1664611) (← links)
- Distributed control of nonstationary LPV systems over arbitrary graphs (Q1678570) (← links)
- On computing the distance to stability for matrices using linear dissipative Hamiltonian systems (Q1679841) (← links)
- Balanced truncation model reduction of nonstationary systems interconnected over arbitrary graphs (Q1679882) (← links)
- Sparsity enabled cluster reduced-order models for control (Q1683852) (← links)
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems (Q1688449) (← links)
- A semi-analytical approach for the positive semidefinite Procrustes problem (Q1688909) (← links)
- Sparse tangent portfolio selection via semi-definite relaxation (Q1694793) (← links)
- A low complexity semidefinite relaxation for large-scale MIMO detection (Q1702828) (← links)
- Exact simultaneous recovery of locations and structure from known orientations and corrupted point correspondences (Q1704899) (← links)
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint (Q1717222) (← links)
- Suspended load path tracking control using a tilt-rotor UAV based on zonotopic state estimation (Q1730037) (← links)
