The following pages link to Semidefinite Programming (Q4877532):
Displayed 50 items.
- 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)
- Reflection-projection method for convex feasibility problems with an obtuse cone (Q704736) (← 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)
- Data dissemination and disclosure limitation in a world without microdata: a risk-utility framework for remote access analysis servers (Q819963) (← links)
- State and unknown input estimation for discrete time multiple model (Q834157) (← links)
- Stability of quadratic modules (Q834811) (← 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)
- 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)
- Reduced vertex set result for interval semidefinite optimization problems (Q956611) (← links)
- Optimization of structural topology in the high-porosity regime (Q957460) (← links)
- Approximating optimization problems over convex functions (Q957934) (← links)
- Largest dual ellipsoids inscribed in dual cones (Q959981) (← links)
- Lower-order penalization approach to nonlinear semidefinite programming (Q995945) (← links)
- Finding positive matrices subject to linear restrictions (Q996327) (← links)
- Parameter estimation with expected and residual-at-risk criteria (Q999831) (← links)
- Estimation of the disturbance structure from data using semidefinite programming and optimal weighting (Q1000801) (← links)
- Interval predictor models: identification and reliability (Q1012735) (← links)
- Duality gap of the conic convex constrained optimization problems in normed spaces (Q1013974) (← links)
- A new primal-dual path-following interior-point algorithm for semidefinite optimization (Q1014697) (← links)
- A nonlinear optimization methodology for VLSI fixed-outline floorplanning (Q1016045) (← links)
- Performance bounds for linear stochastic control (Q1016592) (← links)
- Minimization of the effect of noisy measurements on localization of multi-agent autonomous formations (Q1023378) (← links)
- Numerical approaches for collaborative data processing (Q1027146) (← links)
- Semidefinite characterization and computation of zero-dimensional real radical ideals (Q1029543) (← links)
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700) (← links)
- Polynomial chaos representation of spatio-temporal random fields from experimental measurements (Q1038039) (← links)
- A generalized flat extension theorem for moment matrices (Q1039946) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- On filter-successive linearization methods for nonlinear semidefinite programming (Q1047869) (← links)
- Large margin nearest local mean classifier (Q1048802) (← links)