The following pages link to Semidefinite Programming (Q4877532):
Displaying 50 items.
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- Discretization method for semi-definite programming (Q1770709) (← links)
- A new proof of the strong duality theorem for semidefinite programming (Q1771002) (← links)
- Design of planar articulated mechanisms using branch and bound (Q1780959) (← links)
- Control of rational systems using linear-fractional representations and linear matrix inequalities (Q1815722) (← links)
- Analyticity of the central path at the boundary point in semidefinite programming (Q1848384) (← links)
- Component-wise dimension reduction (Q1874088) (← links)
- Ellipsoidal bounds for uncertain linear equations and dynamical systems (Q1879588) (← links)
- On robust solutions to linear least squares problems affected by data uncertainty and implementation errors with application to stochastic signal modeling (Q1888347) (← links)
- Global optimization for the biaffine matrix inequality problem (Q1913606) (← links)
- On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
- New characterizations of weak sharp minima (Q1926622) (← links)
- International portfolio management with affine policies (Q1927003) (← links)
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming (Q1928305) (← links)
- Set-values filtering for discrete time-delay genetic regulatory networks with time-varying para\-meters (Q1928955) (← links)
- Convex approximations in stochastic programming by semidefinite programming (Q1931652) (← links)
- A new second-order corrector interior-point algorithm for semidefinite programming (Q1935927) (← links)
- Computing maximin efficient experimental designs using the methods of semidefinite programming (Q1936672) (← links)
- Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming (Q1938082) (← links)
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
- A primal-dual semidefinite programming algorithm tailored to the variational determination of the two-body density matrix (Q1943145) (← links)
- Indefinite LQ control for discrete-time stochastic systems via semidefinite programming (Q1955065) (← links)
- Portfolio selection under model uncertainty: a penalized moment-based optimization approach (Q1955553) (← links)
- Optimal and robust waveform design for MIMO radars in the presence of clutter (Q1957223) (← links)
- Methods for the combination of kernel matrices within a support vector framework (Q1959546) (← links)
- Ensemble clustering using semidefinite programming with applications (Q1959572) (← links)
- Stabilizable regions of receding horizon predictive control with input constraints (Q1960642) (← links)
- Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints (Q1968617) (← links)
- Graph rigidity via Euclidean distance matrices (Q1978125) (← links)
- Numerical algebraic geometry and semidefinite programming (Q1979983) (← links)
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
- A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix (Q1993487) (← links)
- Conic stability of polynomials and positive maps (Q1996086) (← links)
- Multivariable robust MPC design for neutralisation plant: experimental analysis (Q1996713) (← links)
- Two-phase simplex method for linear semidefinite optimization (Q2010151) (← links)
- A new effective branch-and-bound algorithm to the high order MIMO detection problem (Q2012893) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868) (← links)
- Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term (Q2018886) (← links)
- Chebyshev center of the intersection of balls: complexity, relaxation and approximation (Q2020607) (← links)
- Distributed resource allocation with binary decisions via Newton-like neural network dynamics (Q2021311) (← links)
- Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
- An improved forecasting approach to reduce inventory levels in decentralized supply chains (Q2023923) (← links)
- T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming (Q2026772) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
- Approximate and exact optimal designs for \(2^k\) factorial experiments for generalized linear models via second order cone programming (Q2029231) (← links)
- Optimal design for manipulation of random consensus over discrete information in networked systems (Q2030988) (← links)
- A modified LM algorithm for tensor complementarity problems over the circular cone (Q2043190) (← links)
- Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval (Q2052715) (← links)
