Pages that link to "Item:Q5896753"
From MaRDI portal
The following pages link to Handbook of semidefinite programming. Theory, algorithms, and applications (Q5896753):
Displaying 50 items.
- Structure method for solving the nearest Euclidean distance matrix problem (Q261791) (← links)
- An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results (Q312194) (← links)
- Continuous multifacility ordered median location problems (Q322399) (← links)
- A feasible primal-dual interior point method for linear semidefinite programming (Q329782) (← links)
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
- Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials (Q354616) (← links)
- A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
- A homotopy method for nonlinear semidefinite programming (Q360377) (← links)
- An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization (Q384182) (← links)
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
- On real one-sided ideals in a free algebra (Q392410) (← links)
- A fresh variational-analysis look at the positive semidefinite matrices world (Q438781) (← links)
- Statistical inference of minimum rank factor analysis (Q463079) (← links)
- A filter method for nonlinear semidefinite programming with global convergence (Q477865) (← links)
- A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals (Q492020) (← links)
- A homotopy method based on penalty function for nonlinear semidefinite programming (Q496592) (← links)
- Determinantal representations and Bézoutians (Q510007) (← links)
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization (Q520262) (← links)
- Free loci of matrix pencils and domains of noncommutative rational functions (Q520758) (← links)
- Robust Farkas' lemma for uncertain linear systems with applications (Q548208) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming (Q623727) (← links)
- A regularized strong duality for nonsymmetric semidefinite least squares problem (Q644518) (← links)
- First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials (Q662299) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Optimality criteria without constraint qualifications for linear semidefinite problems (Q690528) (← links)
- Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces (Q693193) (← links)
- Inexact non-interior continuation method for monotone semidefinite complementarity problems (Q694179) (← links)
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Reflection-projection method for convex feasibility problems with an obtuse cone (Q704736) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- On domains of noncommutative rational functions (Q730613) (← links)
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862) (← links)
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials (Q847674) (← links)
- Semidefinite representation of convex sets (Q847843) (← links)
- The algebraic degree of semidefinite programming (Q847857) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Large-scale semidefinite programs in electronic structure calculation (Q868461) (← links)
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling (Q868464) (← links)
- Optimal scaling of a gradient method for distributed resource allocation (Q868539) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization (Q923998) (← links)
- New bounds on the unconstrained quadratic integer programming problem (Q925231) (← links)
- Semidefinite programming and arithmetic circuit evaluation (Q943844) (← links)
- Bandgap optimization of two-dimensional photonic crystals using semidefinite programming and subspace methods (Q969443) (← links)
- Positive semidefinite quadratic forms on unitary matrices (Q972792) (← links)
