The following pages link to SDPT3 (Q16199):
Displaying 50 items.
- Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming (Q1938082) (← links)
- Discussion: Latent variable graphical model selection via convex optimization (Q1940763) (← links)
- Rejoinder: Latent variable graphical model selection via convex optimization (Q1940764) (← links)
- The tracial moment problem and trace-optimization of polynomials (Q1942272) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming (Q1949595) (← links)
- A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section (Q1954820) (← links)
- An efficient approach to solve the large-scale semidefinite programming problems (Q1955162) (← links)
- Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations (Q1955536) (← links)
- Ensemble clustering using semidefinite programming with applications (Q1959572) (← links)
- Generating and measuring instances of hard semidefinite programs (Q1960189) (← links)
- Exact matrix completion based on low rank Hankel structure in the Fourier domain (Q1979919) (← links)
- Numerical algebraic geometry and semidefinite programming (Q1979983) (← links)
- Composite convex optimization with global and local inexact oracles (Q1986105) (← links)
- Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization (Q1988893) (← links)
- Feedback design for linear control systems with input and output disturbances: a robust formulation (Q1992279) (← links)
- A proximal fully parallel splitting method for stable principal component pursuit (Q1993345) (← links)
- Robust tracking error portfolio selection with worst-case downside risk measures (Q1994379) (← links)
- Conic programming: infeasibility certificates and projective geometry (Q1996078) (← links)
- Explicit hard bounding functions for boundary value problems for elliptic partial differential equations (Q2006566) (← links)
- On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems (Q2007822) (← links)
- Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence (Q2007836) (← links)
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (Q2010087) (← links)
- A fast design algorithm for elliptic-error and phase-error constrained LS 2-D FIR filters (Q2014193) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints (Q2026764) (← links)
- T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming (Q2026772) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- Minimal-norm static feedbacks using dissipative Hamiltonian matrices (Q2029851) (← links)
- Exponential stabilization of sampled-data fuzzy systems via a parameterized fuzzy Lyapunov-Krasovskii functional approach (Q2041418) (← links)
- A dual simplex-type algorithm for the smallest enclosing ball of balls (Q2044498) (← links)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- Mixing convex-optimization bounds for maximum-entropy sampling (Q2044968) (← links)
- Analysis of optimization algorithms via sum-of-squares (Q2046552) (← links)
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood (Q2048820) (← links)
- Fast and robust certifiable estimation of the relative pose between two calibrated cameras (Q2051144) (← links)
- Convex programming based spectral clustering (Q2051294) (← links)
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex (Q2057228) (← links)
- Projection-based integrators for improved motion control: formalization, well-posedness and stability of hybrid integrator-gain systems (Q2065165) (← links)
- Strictly contractive Peaceman-Rachford splitting method to recover the corrupted low rank matrix (Q2067888) (← links)
- \(\mathcal{H}_\infty\) network optimization for edge consensus (Q2068543) (← links)
- Continuous-time switched systems with switching frequency constraints: path-complete stability criteria (Q2071940) (← links)
- Minimum variance constrained estimator (Q2071951) (← links)
- Efficient proximal mapping computation for low-rank inducing norms (Q2073049) (← links)
- Efficient semidefinite programming with approximate ADMM (Q2073055) (← links)
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space (Q2079694) (← links)
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria (Q2088964) (← links)
- A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics (Q2089080) (← links)
- Second-order cone and semidefinite methods for the bisymmetric matrix approximation problem (Q2091722) (← links)
- High-probability stable Gaussian process-supported model predictive control for Lur'e systems (Q2095350) (← links)
