The following pages link to SDPT3 (Q16199):
Displaying 50 items.
- A smoothing Newton method for second-order cone optimization based on a new smoothing function (Q648325) (← links)
- Checking dissipativity of linear behavior systems given in kernel representation (Q661039) (← links)
- Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression (Q662292) (← links)
- Convex optimisation-based methods for K-complex detection (Q668213) (← links)
- Sparse and constrained stochastic predictive control for networked systems (Q680489) (← links)
- Interpreting latent variables in factor models via convex optimization (Q681494) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number (Q690542) (← links)
- Projected Landweber iteration for matrix completion (Q708281) (← links)
- Convex relaxations for mixed integer predictive control (Q710707) (← links)
- A smoothing-type Newton method for second-order cone programming problems based on a new smooth function (Q711514) (← links)
- A new one-step smoothing Newton method for second-order cone programming. (Q713481) (← links)
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming (Q717133) (← links)
- Sparse functional identification of complex cells from spike times and the decoding of visual stimuli (Q723690) (← links)
- Conditional minimum volume ellipsoid with application to multiclass discrimination (Q732238) (← links)
- A new smoothing Newton-type method for second-order cone programming problems (Q734859) (← 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)
- Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization (Q779756) (← links)
- Rank minimization with applications to image noise removal (Q781854) (← links)
- Successive linearization methods for nonlinear semidefinite programs (Q812426) (← 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 line search penalty-free method for nonlinear second-order cone programming (Q829562) (← links)
- A second-order cone cutting surface method: Complexity and application (Q839677) (← links)
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials (Q847674) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- New algorithms for \(k\)-center and extensions (Q849133) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Fitting enclosing cylinders to data in \(\mathbb R^n\) (Q861741) (← links)
- Robust \(\mathcal H_2\) performance analysis and synthesis of linear polytopic discrete-time periodic systems via LMIs (Q864589) (← links)
- A matrix generation approach for eigenvalue optimization (Q868452) (← links)
- Large-scale semidefinite programs in electronic structure calculation (Q868461) (← links)
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems (Q868472) (← links)
- Computational strategy for Russell measure in DEA: second-order cone programming (Q869200) (← links)
- On the worst-case convergence of MR and CG for symmetric positive definite tridiagonal Toeplitz matrices (Q871139) (← links)
- Solving Hankel matrix approximation problem using semidefinite programming (Q875374) (← links)
- A linear-quadratic optimal control problem for mean-field stochastic differential equations in infinite horizon (Q888784) (← 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)
- AAR-based decomposition algorithm for non-linear convex optimisation (Q902092) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- Sub-quadratic convergence of a smoothing Newton method for second-order cone programming (Q949278) (← links)
