SDPT3
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Robust high-order repetitive control: Optimal performance trade-offs
- Projective re-normalization for improving the behavior of a homogeneous conic linear system
- Relaxed maximum a posteriori fault identification
- Accurate time delay estimation based passive localization
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Optimal linear controller design for periodic inputs
- On filter-successive linearization methods for nonlinear semidefinite programming
- Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination
- AMD
- complib
- CSDP
- Applications of semidefinite programming
- Latent variable graphical model selection via convex optimization
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
- QAPLIB
- Tenscalc
- ProxSDP
- TADAM
- SE-Sync
- FivePoint
- FastCertRelPose
- SDPLIB
- Sdpsol
- Sostools
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Non-interior continuation methods for solving semidefinite complementarity problems
- PREQN
- Applications of convex optimization in signal processing and digital communication
- Avoiding numerical cancellation in the interior point method for solving semidefinite programs
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- SOAR
- Solving semidefinite-quadratic-linear programs using SDPT3
- SDPHA
- LFTB
- GLOPTLAB
- SOCP
- Similarity and other spectral relations for symmetric cones
- SDPA
- SCCP
- MAX-2-SAT
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- SDP design procedures for near-optimum IIR compaction filters
- Generalizations of the field of values useful in the study of polynomial functions of a matrix
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- SeDuMi
- VSDP
- lp_solve
- PROPACK
- PEPACK
- Hybrid energy transformation to generalized Reissner-Mindlin model for laminated composite shells
- lpSolve
- FSQP
- A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm
- A simple necessary and sufficient LMI condition for the strong delay-independent stability of LTI systems with single delay
- Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations
- On exploiting inexact scheduling parameters for gain-scheduled control of linear parameter-varying discrete-time systems
- Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- CVXOPT
- SparsePOP
- SolvOpt
- SDPpack
- PENNON
- A two-resource allocation algorithm with an application to large-scale zero-sum defensive games
- GloptiPoly
- Homogeneity detection for the high-dimensional generalized linear model
- DSDP5
- SimpleS
- On constrained estimation of graphical time series models
- Model reduction of distributed nonstationary LPV systems
- Alternating direction method of multipliers for separable convex optimization of real functions in complex variables
- An alternating direction method for convex quadratic second-order cone programming with bounded constraints
- Certificates of infeasibility via nonsmooth optimization
- CHOMPACK
- CVX
- YALMIP
- Optimizing area under the ROC curve using semi-supervised learning
- Distributed control of nonstationary LPV systems over arbitrary graphs
- Benchmarks for Optimization Software
- Mosek
- On computing the distance to stability for matrices using linear dissipative Hamiltonian systems
- Balanced truncation model reduction of nonstationary systems interconnected over arbitrary graphs
- SPOOLES
- Sparsity enabled cluster reduced-order models for control
- LIPSOL
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- A semi-analytical approach for the positive semidefinite Procrustes problem
- QSDP
- SMCP
- ROME
- SDPLR
- SparseCoLO
- CirCut
- COL
- Sparse tangent portfolio selection via semi-definite relaxation
- SDLS
- SFSDP
- DSPCA
- reducedLP
This page was built for software: SDPT3
