The following pages link to Semidefinite Programming (Q4877532):
Displaying 50 items.
- Learning mixtures of truncated basis functions from data (Q111036) (← links)
- Advances in computational Lyapunov analysis using sum-of-squares programming (Q258390) (← links)
- Bootstrapping the \(O\)(\(N\) ) vector models (Q270820) (← links)
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions (Q271981) (← links)
- Some applications of polynomial optimization in operations research and real-time decision making (Q276318) (← links)
- Douglas-Rachford splitting method for semidefinite programming (Q295495) (← links)
- Sufficient optimality conditions hold for almost all nonlinear semidefinite programs (Q304224) (← links)
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
- An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results (Q312194) (← links)
- Partial stabilizability and hidden convexity of indefinite LQ problem (Q330289) (← links)
- Enhancement of genuine multipartite entanglement and purity of three qubits under decoherence via bang-bang pulses with finite period (Q331897) (← links)
- Approximating the little Grothendieck problem over the orthogonal and unitary groups (Q344957) (← links)
- Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials (Q354616) (← links)
- SDP reformulation for robust optimization problems based on nonconvex QP duality (Q354630) (← links)
- A novel LMI-based optimization algorithm for the guaranteed estimation of the domain of attraction using rational Lyapunov functions (Q357969) (← links)
- New semidefinite programming relaxations for box constrained quadratic program (Q365811) (← links)
- Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity (Q367164) (← links)
- Sufficient conditions for global optimality of semidefinite optimization (Q371939) (← links)
- Robust international portfolio management (Q373171) (← links)
- Stochastic nuclear outages semidefinite relaxations (Q373211) (← links)
- Optimization under uncertainty with applications to design of truss structures (Q373938) (← links)
- Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming (Q378284) (← links)
- On some fundamental properties of structural topology optimization problems (Q381478) (← links)
- A feasible directions method for nonsmooth convex optimization (Q381628) (← links)
- Lower and upper bounds for the largest Lyapunov exponent of matrices (Q389726) (← links)
- Distributed set-valued estimation in sensor networks with limited communication data rate (Q397747) (← links)
- Nonlinear \(H_\infty\) feedback control with integrator for polynomial discrete-time systems (Q402005) (← links)
- Computing the lowest equilibrium pose of a cable-suspended rigid body (Q402228) (← links)
- Copositivity and constrained fractional quadratic problems (Q403649) (← links)
- Discrete-time indefinite stochastic LQ control via SDP and LMI methods (Q411051) (← links)
- A majorization-minimization approach to the sparse generalized eigenvalue problem (Q413888) (← links)
- Gradient-type methods: a unified perspective in computer science and numerical analysis (Q420252) (← links)
- Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs (Q421275) (← links)
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- Optimal link removal for epidemic mitigation: A two-way partitioning approach (Q423087) (← links)
- Optimality theorems for convex semidefinite vector optimization problems (Q425863) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- Mixtures of truncated basis functions (Q432987) (← links)
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure (Q439501) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- Linear-quadratic switching control with switching cost (Q445146) (← links)
- A quantum characterization of NP (Q445251) (← links)
- Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets (Q452335) (← links)
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems (Q453058) (← links)
- A new necessary condition for Turing instabilities (Q453075) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- On duality gap in binary quadratic programming (Q454277) (← links)
- Semi-supervised clustering with discriminative random fields (Q454430) (← links)
- The space decomposition theory for a class of eigenvalue optimizations (Q457214) (← links)
