The following pages link to Semidefinite Programming (Q4877532):
Displaying 50 items.
- Elliptic and hyperbolic quadratic eigenvalue problems and associated distance problems. (Q1406280) (← links)
- Spectral methods for graph bisection problems. (Q1406654) (← links)
- Semidefinite programming and matrix scaling over the semidefinite cone. (Q1414710) (← links)
- Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) (← links)
- Specialized fast algorithms for IQC feasibility and optimization problems. (Q1428693) (← links)
- Indefinite stochastic LQ control with cross term via semidefinite programming (Q1429334) (← links)
- Multiobjective duality for convex semidefinite programming problems (Q1431149) (← links)
- Convex analysis on Cartan subspaces. (Q1582400) (← links)
- Well-posedness and attainability of indefinite stochastic linear quadratic control in infinite time horizon (Q1583219) (← links)
- On weighted centers for semidefinite programming (Q1584796) (← links)
- Interior-point methods (Q1593831) (← links)
- Nonnegative minimum biased quadratic estimation in mixed linear models (Q1599237) (← links)
- Semidefinite programming (Q1600854) (← links)
- Robust one-step receding horizon control of discrete-time Markovian jump uncertain systems (Q1614376) (← links)
- Certifying numerical estimates of spectral gaps (Q1647864) (← links)
- Constraint consensus methods for finding strictly feasible points of linear matrix inequalities (Q1659091) (← links)
- Nonlinear state feedback control for a class of polynomial nonlinear discrete-time systems with norm-bounded uncertainties: an integrator approach (Q1659377) (← links)
- An algorithm based on semidefinite programming for finding minimax optimal designs (Q1662093) (← links)
- Nested nonnegative cone analysis (Q1663282) (← links)
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization (Q1664251) (← links)
- Fast prediction with sparse multikernel LS-SVR using multiple relevant time series and its application in avionics system (Q1665732) (← links)
- The matching problem has no small symmetric SDP (Q1675264) (← links)
- Optimizing area under the ROC curve using semi-supervised learning (Q1677038) (← links)
- Foundational contributions of K. Asai and H. Tanaka to fuzzy optimization (Q1677107) (← links)
- On the efficient low cost procedure for estimation of high-dimensional prediction error covariance matrices (Q1679123) (← links)
- UTA-poly and UTA-splines: additive value functions with polynomial marginals (Q1681484) (← links)
- A unified approach to operator monotone functions (Q1690685) (← links)
- A new branch-and-bound approach to semi-supervised support vector machine (Q1699749) (← links)
- Adaptive grid semidefinite programming for finding optimal designs (Q1702022) (← links)
- Robust fitting of ellipsoids by separating interior and exterior points during optimization (Q1702591) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs (Q1706408) (← links)
- Testing local-realism and macro-realism under generalized dichotomic measurements (Q1708120) (← links)
- Inexact SA method for constrained stochastic convex SDP and application in Chinese stock market (Q1709750) (← links)
- A novel neural network for solving semidefinite programming problems with some applications (Q1713177) (← links)
- The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems (Q1715729) (← links)
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem (Q1724494) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- On equivalence of major relaxation methods for minimum ellipsoid covering intersection of ellipsoids (Q1737845) (← links)
- Einstein-Podolsky-Rosen steering and quantum phase transition in spin chains (Q1740722) (← links)
- Livsic-type determinantal representations and hyperbolicity (Q1744552) (← links)
- A variant of the dual simplex method for a linear semidefinite programming problem (Q1744997) (← links)
- A semidefinite programming method for integer convex quadratic minimization (Q1749779) (← links)
- Visualizing network communities with a semi-definite programming method (Q1750020) (← links)
- Random Laplacian matrices and convex relaxations (Q1750385) (← links)
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
- The Russell measure model: computational aspects, duality, and profit efficiency (Q1754336) (← links)
- An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers (Q1760902) (← links)
- Uncertain convex programs: randomized solutions and confidence levels (Q1769067) (← links)
