The following pages link to SDPT3 (Q16199):
Displaying 50 items.
- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems (Q2436689) (← links)
- A majorized penalty approach to inverse linear second order cone programming problems (Q2438414) (← links)
- On the balanced truncation and coprime factors reduction of Markovian jump linear systems (Q2440039) (← links)
- A cutting plane method for solving KYP-SDPs (Q2440612) (← links)
- Outlier detection and robust covariance estimation using mathematical programming (Q2442793) (← links)
- Outlier detection and least trimmed squares approximation using semi-definite programming (Q2445775) (← links)
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
- Semidefinite relaxations for semi-infinite polynomial programming (Q2450900) (← links)
- Reconfigurable predictive control for redundantly actuated systems with parameterised input constraints (Q2454054) (← links)
- Mathematical construction of a Reissner-Mindlin plate theory for composite laminates (Q2454605) (← links)
- An SQP-type algorithm for nonlinear second-order cone programs (Q2458912) (← links)
- Recovering risk-neutral probability density functions from options prices using cubic splines and ensuring nonnegativity (Q2463504) (← links)
- Dual versus primal-dual interior-point methods for linear and conic programming (Q2467157) (← links)
- Approximate Toeplitz matrix problem using semidefinite programming (Q2483033) (← links)
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints (Q2487469) (← links)
- Robust classification and regression using support vector machines (Q2497274) (← links)
- Coprime factors reduction methods for linear parameter varying and uncertain systems (Q2504649) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
- Fast singular value thresholding without singular value decomposition (Q2511250) (← links)
- Semidefinite programming relaxations and algebraic optimization in control (Q2512289) (← links)
- A one-parametric class of smoothing functions for second-order cone programming (Q2514078) (← links)
- Phase recovery, MaxCut and complex semidefinite programming (Q2515033) (← links)
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
- Selected applications of convex optimization (Q2515153) (← links)
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
- LFTB: an efficient algorithm to bound linear fractional transformations (Q2575247) (← links)
- Phaselift is robust to a constant fraction of arbitrary errors (Q2627892) (← links)
- Reliable approximations of probability-constrained stochastic linear-quadratic control (Q2628676) (← links)
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← links)
- Semidefinite programming for uncertain linear equations in static analysis of structures (Q2638116) (← links)
- A conversion of an SDP having free variables into the standard form SDP (Q2643612) (← links)
- Exact matrix completion via convex optimization (Q2655288) (← links)
- Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
- A successive SDP-NSDP approach to a robust optimization problem in finance (Q2655406) (← links)
- Linear matrix inequalities in control systems with uncertainty (Q2660497) (← links)
- Some investigations on convergence of GMRES in solving BEM equations for slender beam structures (Q2662416) (← links)
- Boundary control design for conservation laws in the presence of measurement disturbances (Q2663312) (← links)
- A barrier function approach to finite-time stochastic system verification and control (Q2663942) (← links)
- Generating irreducible copositive matrices using the stable set problem (Q2664002) (← links)
- Derivative feedback control of nonlinear systems with uncertain equilibrium states and actuator constraints (Q2664220) (← links)
- Reference tracking stochastic model predictive control over unreliable channels and bounded control actions (Q2664244) (← links)
- On the approximation of unbounded convex sets by polyhedra (Q2671446) (← links)
- Moment and polynomial bounds for ruin-related quantities in risk theory (Q2672152) (← links)
- Long-step path-following algorithm for quantum information theory: some numerical aspects and applications (Q2673269) (← links)
- Limited memory BFGS method for least squares semidefinite programming with banded structure (Q2674941) (← links)
- Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules (Q2677664) (← links)
- Numerical detection of Gaussian entanglement and its application to the identification of bound entangled Gaussian states (Q2681564) (← links)
- Control design under actuator saturation and multi-rate sampling (Q2682313) (← links)
- Automated machine learning can classify bound entangled states with tomograms (Q2687197) (← links)
