The following pages link to SDPT3 (Q16199):
Displaying 50 items.
- Analysis of a non-interior continuation method for second-order cone programming (Q949295) (← links)
- Semidefinite programming for the educational testing problem (Q953303) (← links)
- A one-step smoothing Newton method for second-order cone programming (Q953375) (← links)
- A distributed controller approach for delay-independent stability of networked control systems (Q963774) (← links)
- Semi-definite programming techniques for structured quadratic inverse eigenvalue problems (Q964207) (← links)
- Bandgap optimization of two-dimensional photonic crystals using semidefinite programming and subspace methods (Q969443) (← links)
- A parallel interior point decomposition algorithm for block angular semidefinite programs (Q969720) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- Semidefinite programming for approximate maximum likelihood sinusoidal parameter estimation (Q983740) (← links)
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming (Q984697) (← links)
- Design of oversampled double-prototype DFT modulated filter banks via bi-iterative second-order cone program (Q985494) (← 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)
- Encoding dissimilarity data for statistical model building (Q993793) (← links)
- Formulation and solution of some plasticity problems as conic programs (Q996612) (← links)
- Robust high-order repetitive control: Optimal performance trade-offs (Q1004138) (← links)
- Projective re-normalization for improving the behavior of a homogeneous conic linear system (Q1016122) (← links)
- Relaxed maximum a posteriori fault identification (Q1016851) (← links)
- Accurate time delay estimation based passive localization (Q1032357) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- Optimal linear controller design for periodic inputs (Q1046608) (← links)
- On filter-successive linearization methods for nonlinear semidefinite programming (Q1047869) (← links)
- Applications of semidefinite programming (Q1294557) (← links)
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming (Q1349146) (← links)
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming (Q1365057) (← links)
- Non-interior continuation methods for solving semidefinite complementarity problems (Q1396829) (← links)
- Applications of convex optimization in signal processing and digital communication (Q1403287) (← links)
- Avoiding numerical cancellation in the interior point method for solving semidefinite programs (Q1411639) (← links)
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results (Q1411643) (← links)
- Similarity and other spectral relations for symmetric cones (Q1573667) (← links)
- Aspects of semidefinite programming. Interior point algorithms and selected applications (Q1597978) (← links)
- SDP design procedures for near-optimum IIR compaction filters (Q1603845) (← links)
- Generalizations of the field of values useful in the study of polynomial functions of a matrix (Q1611848) (← links)
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach (Q1616936) (← 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)
- Homogeneity detection for the high-dimensional generalized linear model (Q1658352) (← links)
- On constrained estimation of graphical time series models (Q1662855) (← 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)
- An alternating direction method for convex quadratic second-order cone programming with bounded constraints (Q1665536) (← links)
- Certificates of infeasibility via nonsmooth optimization (Q1675645) (← links)
- Optimizing area under the ROC curve using semi-supervised learning (Q1677038) (← links)
