Handbook of semidefinite programming. Theory, algorithms, and applications
From MaRDI portal
Publication:5896753
zbMath0951.90001MaRDI QIDQ5896753
No author found.
Publication date: 2000
Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)
Semidefinite programming (90C22) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)
Related Items (only showing first 100 items - show all)
D-optimal matrices via quadratic integer optimization ⋮ A globally convergent QP-free algorithm for nonlinear semidefinite programming ⋮ On dimensional rigidity of bar-and-joint frameworks ⋮ Classification of companies using maximal margin ellipsoidal surfaces ⋮ An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results ⋮ Semidefinite programming and sums of Hermitian squares of noncommutative polynomials ⋮ Semidefinite representation of convex sets ⋮ The algebraic degree of semidefinite programming ⋮ On verified numerical computations in convex programming ⋮ Continuous multifacility ordered median location problems ⋮ A feasible primal-dual interior point method for linear semidefinite programming ⋮ Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster ⋮ Minimizer Extraction in Polynomial Optimization Is Robust ⋮ Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials ⋮ A computational study and survey of methods for the single-row facility layout problem ⋮ Large-scale semidefinite programs in electronic structure calculation ⋮ Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling ⋮ Optimal scaling of a gradient method for distributed resource allocation ⋮ Can you compute the operator norm? ⋮ A homotopy method for nonlinear semidefinite programming ⋮ On yielding and jointly yielding entries of Euclidean distance matrices ⋮ The quadratic knapsack problem -- a survey ⋮ On the algebraic Riccati inequality arising in cone-preserving time-delay systems ⋮ An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs ⋮ An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization ⋮ A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function ⋮ On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming ⋮ Strong duality and minimal representations for cone optimization ⋮ On real one-sided ideals in a free algebra ⋮ Facial Reduction and Partial Polyhedrality ⋮ Deciding Polyhedrality of Spectrahedra ⋮ Ellipsoidal load-domain shakedown analysis with von Mises yield criterion: A robust optimization approach ⋮ A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization ⋮ A decomposition algorithm for KYP-SDPs ⋮ A semidefinite optimization approach to the target visitation problem ⋮ A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming ⋮ The tracial moment problem and trace-optimization of polynomials ⋮ Variational Gram Functions: Convex Analysis and Optimization ⋮ A full NT-step infeasible interior-point algorithm for semidefinite optimization ⋮ On affine motions and universal rigidity of tensegrity frameworks ⋮ Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs ⋮ A fresh variational-analysis look at the positive semidefinite matrices world ⋮ Inexact SA method for constrained stochastic convex SDP and application in Chinese stock market ⋮ A relaxed-certificate facial reduction algorithm based on subspace intersection ⋮ A regularized strong duality for nonsymmetric semidefinite least squares problem ⋮ Generating and measuring instances of hard semidefinite programs ⋮ Semidefinite resolution and exactness of semidefinite relaxations for satisfiability ⋮ Statistical inference of minimum rank factor analysis ⋮ Primal-dual interior-point algorithm for convex quadratic semi-definite optimization ⋮ New bounds on the unconstrained quadratic integer programming problem ⋮ Cardinality constrained minimum cut problems: complexity and algorithms. ⋮ A filter method for nonlinear semidefinite programming with global convergence ⋮ First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials ⋮ A guide to conic optimisation and its applications ⋮ Semidefinite optimization models for limit and shakedown analysis problems involving matrix spreads ⋮ A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals ⋮ Statistical inference of semidefinite programming ⋮ A homotopy method based on penalty function for nonlinear semidefinite programming ⋮ Semidefinite programming and arithmetic circuit evaluation ⋮ New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation ⋮ An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming ⋮ Determinantal representations and Bézoutians ⋮ A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming ⋮ On semidefinite least squares and minimal unsatisfiability ⋮ Norm bounds and underestimators for unconstrained polynomial integer minimization ⋮ An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization ⋮ Free loci of matrix pencils and domains of noncommutative rational functions ⋮ Optimality criteria without constraint qualifications for linear semidefinite problems ⋮ Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces ⋮ Inexact non-interior continuation method for monotone semidefinite complementarity problems ⋮ Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ Bandgap optimization of two-dimensional photonic crystals using semidefinite programming and subspace methods ⋮ Robust Farkas' lemma for uncertain linear systems with applications ⋮ Positive semidefinite quadratic forms on unitary matrices ⋮ Reflection-projection method for convex feasibility problems with an obtuse cone ⋮ On self-regular IPMs (with comments and rejoinder) ⋮ Robust global optimization with polynomials ⋮ Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons ⋮ Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone ⋮ A new measure of technical efficiency in data envelopment analysis based on the maximization of hypervolumes: benchmarking, properties and computational aspects ⋮ Stochastic dynamic cutting plane for multistage stochastic convex programs ⋮ Lower-order penalization approach to nonlinear semidefinite programming ⋮ Interior-point methods for optimization ⋮ New semidefinite programming relaxations for the linear ordering and the traveling salesman problem ⋮ On domains of noncommutative rational functions ⋮ Noncommutative polynomials nonnegative on a variety intersect a convex set ⋮ A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step ⋮ A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization ⋮ A new primal-dual path-following interior-point algorithm for semidefinite optimization ⋮ A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function ⋮ Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming ⋮ Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent ⋮ Duality for semi-definite and semi-infinite programming ⋮ An interior point-proximal method of multipliers for linear positive semi-definite programming ⋮ Stochastic second-order cone programming in mobile ad hoc networks ⋮ Inexact non-interior continuation method for solving large-scale monotone SDCP ⋮ Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints ⋮ Optimality Conditions in Semidefinite Programming ⋮ Structure method for solving the nearest Euclidean distance matrix problem
This page was built for publication: Handbook of semidefinite programming. Theory, algorithms, and applications
