Pages that link to "Item:Q5915427"
From MaRDI portal
The following pages link to Handbook of semidefinite programming. Theory, algorithms, and applications (Q5915427):
Displaying 50 items.
- Sequential semidefinite program for maximum robustness design of structures under load uncertainty (Q868549) (← links)
- Computational strategy for Russell measure in DEA: second-order cone programming (Q869200) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- Half thresholding eigenvalue algorithm for semidefinite matrix completion (Q887385) (← links)
- Generalized semi-infinite programming: a tutorial (Q929611) (← links)
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls (Q946350) (← links)
- Semi-definite programming techniques for structured quadratic inverse eigenvalue problems (Q964207) (← links)
- On cone of nonsymmetric positive semidefinite matrices (Q979007) (← links)
- Estimation of the disturbance structure from data using semidefinite programming and optimal weighting (Q1000801) (← links)
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
- Semidefinite characterization and computation of zero-dimensional real radical ideals (Q1029543) (← links)
- On filter-successive linearization methods for nonlinear semidefinite programming (Q1047869) (← links)
- On the uniqueness of Euclidean distance matrix completions. (Q1405021) (← links)
- Recursive algorithms for inner ellipsoidal approximation of convex polytopes. (Q1413940) (← links)
- Semidefinite programming and matrix scaling over the semidefinite cone. (Q1414710) (← links)
- Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) (← links)
- Aspects of semidefinite programming. Interior point algorithms and selected applications (Q1597978) (← links)
- Semidefinite programming (Q1600854) (← links)
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach (Q1616936) (← links)
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
- Geometry of free loci and factorization of noncommutative polynomials (Q1647393) (← links)
- Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)
- On approximate solutions for robust convex semidefinite optimization problems (Q1670443) (← links)
- On the extension of an arc-search interior-point algorithm for semidefinite optimization (Q1713225) (← links)
- Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function (Q1733331) (← links)
- A variant of the dual simplex method for a linear semidefinite programming problem (Q1744997) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position (Q1774976) (← links)
- Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming (Q1779251) (← links)
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions (Q1790186) (← links)
- Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms (Q1877018) (← links)
- Symmetry groups, semidefinite programs, and sums of squares (Q1878418) (← links)
- Uniqueness of the solutions of some completion problems (Q1887497) (← links)
- On robust solutions to linear least squares problems affected by data uncertainty and implementation errors with application to stochastic signal modeling (Q1888347) (← links)
- A semidefinite approach for truncated \(K\)-moment problems (Q1928277) (← links)
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming (Q1928305) (← links)
- Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083) (← links)
- Newsvendor games: convex optimization of centralized inventory operations (Q1939101) (← links)
- The matricial relaxation of a linear matrix inequality (Q1949260) (← links)
- A globally convergent filter-type trust region method for semidefinite programming (Q1955230) (← links)
- Optimization and stabilization of hierarchical electrical networks (Q1979700) (← links)
- Numerical algebraic geometry and semidefinite programming (Q1979983) (← links)
- Noisy Euclidean distance matrix completion with a single missing node (Q2010104) (← links)
- Two-phase simplex method for linear semidefinite optimization (Q2010151) (← links)
- A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming (Q2023745) (← links)
- An efficient parameterized logarithmic kernel function for semidefinite optimization (Q2023749) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
- Noncommutative polynomials describing convex sets (Q2031064) (← links)
- Quadratic maximization of reachable values of affine systems with diagonalizable matrix (Q2032024) (← links)
