The following pages link to Semidefinite Programming (Q4877532):
Displaying 50 items.
- An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming (Q457716) (← links)
- Robust control of uncertain systems: classical results and recent developments (Q458745) (← links)
- A statistical learning theory approach for uncertain linear and bilinear matrix inequalities (Q458858) (← links)
- Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
- Maximum divert for planetary landing using convex optimization (Q463013) (← links)
- A filter method for nonlinear semidefinite programming with global convergence (Q477865) (← links)
- Truss topology optimization with discrete design variables by outer approximation (Q486729) (← links)
- A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals (Q492020) (← links)
- Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse (Q493248) (← links)
- Path following in the exact penalty method of convex programming (Q493687) (← links)
- A generalization of Löwner-John's ellipsoid theorem (Q494343) (← links)
- A differentiable reformulation for E-optimal design of experiments in nonlinear dynamic biosystems (Q494485) (← links)
- \( H_\infty\) control for networked systems with multiple packet dropouts (Q497657) (← links)
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods (Q507324) (← links)
- Exactness criteria for SDP-relaxations of quadratic extremum problems (Q508574) (← links)
- Determinantal representations and Bézoutians (Q510007) (← links)
- Measurement uncertainty for finite quantum observables (Q515437) (← links)
- A fast space-decomposition scheme for nonconvex eigenvalue optimization (Q526388) (← links)
- Strong stationarity for optimization problems with complementarity constraints in absence of polyhedricity. With applications to optimization with semidefinite and second-order-cone complementarity constraints (Q526392) (← links)
- Total variation reconstruction from quadratic measurements (Q526711) (← links)
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization (Q526833) (← links)
- A semidefinite programming study of the Elfving theorem (Q546096) (← links)
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling (Q548547) (← links)
- Design of a multiple kernel learning algorithm for LS-SVM by convex programming (Q553288) (← links)
- A preliminary set of applications leading to stochastic semidefinite programs and chance-constrained semidefinite programs (Q554728) (← links)
- Angular synchronization by eigenvectors and semidefinite programming (Q617701) (← links)
- Optimal and covariant single-copy LOCC transformation between two two-qubit states (Q620834) (← links)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- Alternating direction augmented Lagrangian methods for semidefinite programming (Q621749) (← links)
- An equivalency condition of nonsingularity in nonlinear semidefinite programming (Q625675) (← links)
- Sparse approximation of functions using sums of exponentials and AAK theory (Q630493) (← links)
- Correlated equilibria in continuous games: characterization and computation (Q632966) (← links)
- Obtaining certificates for complete synchronisation of coupled oscillators (Q633756) (← links)
- Waveform optimization for MIMO-STAP to improve the detection performance (Q634898) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach (Q646169) (← links)
- Primal and dual linear decision rules in stochastic and robust optimization (Q647394) (← links)
- Generalized Benders' decomposition for topology optimization problems (Q652657) (← links)
- A probabilistic model for bounded elasticity tensor random fields with application to polycrystalline microstructures (Q653713) (← links)
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients (Q654030) (← links)
- An efficient algorithm for maximal margin clustering (Q656840) (← links)
- Model decomposition and reduction tools for large-scale networks in systems biology (Q665143) (← links)
- Establishing quantum steerability on cavity arrays coupled by optical fibers with open boundary conditions (Q670004) (← links)
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems (Q681722) (← links)
- Disturbance rejection control based on state-reconstruction and persistence disturbance estimation (Q682676) (← links)
- Stochastic second-order cone programming: applications models (Q693671) (← links)
- A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis (Q697556) (← links)
- Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
- The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems (Q702592) (← links)
