The following pages link to Semidefinite Programming (Q4877532):
Displaying 50 items.
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex (Q2057228) (← links)
- A numerical study of single source localization algorithms for phaseless inverse scattering problems (Q2069128) (← links)
- Distributionally robust optimization. A review on theory and applications (Q2074636) (← links)
- Complexity aspects of local minima and related notions (Q2074805) (← links)
- An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
- Static output feedback stabilization of uncertain rational nonlinear systems with input saturation (Q2086983) (← links)
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs (Q2089773) (← links)
- On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization (Q2091085) (← links)
- Quantification of resource theory of imaginarity (Q2099618) (← links)
- Dimension-free entanglement detection in multipartite Werner states (Q2099794) (← links)
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations (Q2116587) (← links)
- Distributionally-robust machine learning using locally differentially-private data (Q2128767) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- Distributed solver for linear matrix inequalities: an optimization perspective (Q2138940) (← links)
- A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization (Q2142525) (← links)
- On the complexity of Putinar-Vasilescu's Positivstellensatz (Q2145082) (← links)
- Fitting Laplacian regularized stratified Gaussian models (Q2147926) (← links)
- Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
- Augmented Lagrangian methods for convex matrix optimization problems (Q2158112) (← links)
- Bounds-constrained polynomial approximation using the Bernstein basis (Q2168063) (← links)
- Guarantees of Riemannian optimization for low rank matrix completion (Q2176515) (← links)
- Generically globally rigid graphs have generic universally rigid frameworks (Q2182252) (← links)
- Theorems of the alternative for conic integer programming (Q2183216) (← links)
- Hahn-Banach-type theorems and applications to optimization for partially ordered vector space-valued invariant operators (Q2188789) (← links)
- The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications (Q2190318) (← links)
- On the existence of epipolar matrices (Q2193532) (← links)
- Dynamic behavior analysis via structured rank minimization (Q2193906) (← links)
- Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
- New and updated semidefinite programming bounds for subspace codes (Q2210639) (← links)
- A performance guaranteed sampled-data event-triggered consensus approach for linear multi-agent systems (Q2213106) (← links)
- Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems (Q2219444) (← links)
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion (Q2236545) (← links)
- Different Bell inequalities as probes to detect quantum phase transitions (Q2239519) (← links)
- \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications (Q2240656) (← links)
- Extent-compatible control barrier functions (Q2242997) (← links)
- An algorithm for matrix recovery of high-loss-rate network traffic data (Q2243486) (← links)
- Performance of first-order methods for smooth convex minimization: a novel approach (Q2248759) (← links)
- The asymptotic bias of minimum trace factor analysis, with applications to the greatest lower bound to reliability (Q2250641) (← links)
- Learning with tensors: a framework based on convex optimization and spectral regularization (Q2251466) (← links)
- A robust fault detection design for uncertain Takagi-Sugeno models with unknown inputs and time-varying delays (Q2252982) (← links)
- How to solve a semi-infinite optimization problem (Q2253347) (← links)
- An admissible dual internal point method for a linear semidefinite programming problem (Q2261706) (← links)
- On the problem of packing spheres in a cube (Q2263331) (← links)
- Modeling, inference and optimization of regulatory networks based on time series data (Q2275594) (← links)
- Co-design of safe and efficient networked control systems in factory automation with state-dependent wireless fading channels (Q2280705) (← links)
- An oracle for the discrete-time integral quadratic constraint problem (Q2280816) (← links)
- Data collection in population protocols with non-uniformly random scheduler (Q2285150) (← links)
- Application of the method of semidefinite relaxation for determining the orientation of a solid body in space (Q2290408) (← links)
- On risk-averse stochastic semidefinite programs with continuous recourse (Q2296250) (← links)
- Optimality conditions and global convergence for nonlinear semidefinite programming (Q2297647) (← links)
