The following pages link to Semidefinite Programming (Q4877532):
Displaying 50 items.
- Reflection-projection method for convex feasibility problems with an obtuse cone (Q704736) (← links)
- Feasibility and solvability of Lyapunov-type linear programming over symmetric cones (Q707872) (← links)
- A primal-dual interior point method for nonlinear semidefinite programming (Q715092) (← links)
- A convex polynomial that is not sos-convex (Q715094) (← links)
- Semidefinite optimization in discrepancy theory (Q715251) (← links)
- Quantum convex support (Q716430) (← links)
- Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints (Q716749) (← links)
- Faithful squashed entanglement (Q717116) (← links)
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming (Q717133) (← links)
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- Antagonistic control (Q730107) (← links)
- Handwritten chinese text line segmentation by clustering with distance metric learning (Q733043) (← links)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- Bounds for codes by semidefinite programming (Q735630) (← links)
- Characterizing the universal rigidity of generic frameworks (Q741616) (← links)
- Space tensor conic programming (Q742309) (← links)
- Wireless capacity with arbitrary gain matrix (Q742412) (← links)
- Positive semidefinite rank (Q745689) (← links)
- Smaller SDP for SOS decomposition (Q746820) (← links)
- The complexity of relating quantum channels to master equations (Q766099) (← links)
- Construction of a class of sharp Löwner majorants for a set of symmetric matrices (Q778636) (← links)
- Data dissemination and disclosure limitation in a world without microdata: a risk-utility framework for remote access analysis servers (Q819963) (← links)
- Inverse conic linear programs in Banach spaces (Q828644) (← links)
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
- State and unknown input estimation for discrete time multiple model (Q834157) (← links)
- Stability of quadratic modules (Q834811) (← links)
- The algebraic degree of semidefinite programming (Q847857) (← links)
- LMI approach to robust model predictive control (Q850827) (← links)
- Stochastic semidefinite programming: a new paradigm for stochastic optimization (Q862822) (← links)
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals (Q863907) (← links)
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling (Q868464) (← links)
- Properties of the augmented Lagrangian in nonlinear semidefinite optimization (Q868537) (← links)
- Optimal scaling of a gradient method for distributed resource allocation (Q868539) (← links)
- On KKT points of homogeneous programs (Q868557) (← links)
- A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines (Q869526) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- On approximating complex quadratic optimization problems via semidefinite programming relaxations (Q877200) (← links)
- A Newton-like method for solving rank constrained linear matrix inequalities (Q880379) (← links)
- Optimal design and verification of temporal and spatial filters using second-order cone programming approach (Q882708) (← links)
- Penalty and barrier methods for convex semidefinite programming (Q883081) (← links)
- SOS approximations of nonnegative polynomials via simple high degree perturbations (Q883108) (← links)
- Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case (Q888469) (← links)
- A linear-quadratic optimal control problem for mean-field stochastic differential equations in infinite horizon (Q888784) (← links)
- A perspective-based convex relaxation for switched-affine optimal control (Q893481) (← links)
- The \(H\)-differentiability and calmness of circular cone functions (Q897057) (← links)
- Generalized semi-infinite programming: a tutorial (Q929611) (← links)
- Uniform LP duality for semidefinite and semi-infinite programming (Q940834) (← links)
- Exact relaxations of non-convex variational problems (Q941046) (← links)
- Feature extraction using constrained maximum variance mapping (Q941563) (← links)
